# YOU CAN DOWNLOAD 200+ SUBJECTS PDF BOOK FOR COMPETITIVE EXAMINATIONS

## Data Structure Questions and Answers-Binary Tree Properties

Question 1 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The number of edges from the root to the node is called ..... of the tree.

Height | |

Depth | |

Length | |

None of the mentioned |

Question 1 Explanation:

None.

Question 2 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

The number of edges from the node to the deepest leaf is called ..... of the tree.

Height | |

Depth | |

Length | |

None of the mentioned |

Question 2 Explanation:

None.

Question 3 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is a full binary tree?

Each node has exactly zero or two children | |

Each node has exactly two children | |

All the leaves are at the same level | |

Each node has exactly one or two children |

Question 3 Explanation:

None.

Question 4 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is a complete binary tree?

Each node has exactly zero or two children | |

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left | |

A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right | |

None of the mentioned |

Question 4 Explanation:

None.

Question 5 [CLICK ON ANY CHOICE TO KNOW THE RIGHT ANSWER] |

What is the time complexity for finding the height of the binary tree?

h = O(loglogn) | |

h = O(nlogn) | |

h = O(n) | |

h = O(log n) |

Question 5 Explanation:

The nodes are either a part of left sub tree or the right sub tree, so we don't have to traverse all the nodes, this means the complexity is lesser than n, in the average case, assuming the nodes are spread evenly, the time complexity becomes O(n).

There are 5 questions to complete.