51. Which of the below diagram is following AVL tree property?
/1725429925-61-3.png "Binary Search Trees(B Tree) mcq question image")
52. Is mathematical randomized tree can be generated using beta distribution.
53. The minimum height of self balancing binary search tree with n nodes is . . . . . . . .
54. What is a threaded binary tree traversal?
55. In a full binary tree if number of internal nodes is I, then number of nodes N are?
56. What should be the condition for the level of a left node?
57. Is tango tree represented as a tree of trees.
58. Consider the pseudo code:
int avl(binarysearchtree root):
if(not root)
return 0
left_tree_height = avl(left_of_root)
if(left_tree_height== -1)
return left_tree_height
right_tree_height= avl(right_of_root)
if(right_tree_height==-1)
return right_tree_height
Does the above code can check if a binary search tree is an AVL tree?
int avl(binarysearchtree root):
if(not root)
return 0
left_tree_height = avl(left_of_root)
if(left_tree_height== -1)
return left_tree_height
right_tree_height= avl(right_of_root)
if(right_tree_height==-1)
return right_tree_height59. Who invented treaps?
60. Which of the following data structures can be efficiently implemented using height balanced binary search tree?
Read More Section(Binary Search Trees(B Tree))
Each Section contains maximum 100 MCQs question on Binary Search Trees(B Tree). To get more questions visit other sections.