# Data Structure Questions and Answers-Binary Tree Properties

## Click on any option to know the CORRECT ANSWERS

 Question 1
The number of edges from the root to the node is called ..... of the tree.
 A Height B Depth C Length D None of the mentioned

Question 1 Explanation:
None.

 Question 2
The number of edges from the node to the deepest leaf is called ..... of the tree.
 A Height B Depth C Length D None of the mentioned

Question 2 Explanation:
None.

 Question 3
What is a full binary tree?
 A Each node has exactly zero or two children B Each node has exactly two children C All the leaves are at the same level D Each node has exactly one or two children

Question 3 Explanation:
None.

 Question 4
What is a complete binary tree?
 A Each node has exactly zero or two children B A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from right to left C A binary tree, which is completely filled, with the possible exception of the bottom level, which is filled from left to right D None of the mentioned

Question 4 Explanation:
None.

 Question 5
What is the time complexity for finding the height of the binary tree?
 A h = O(loglogn) B h = O(nlogn) C h = O(n) D h = O(log n)