A binary search tree whose left subtree and right subtree differ in hight by at most 1 unit is called ……

Related MCQs

• Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is
• When converting binary tree into extended binary tree, all the original nodes in binary tree are___________.
• An AVL tree is a self – balancing binary search tree, in which the heights of the two child sub trees of any node differ by
• The binary tree sort implemented using a self – balancing binary search tree takes time is worst case.
• A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?
• A binary tree in which all its levels except the last, have maximum numbers of nodes, and all the nodes in the last level have only one child it will be its left child. Name the tree.
• A binary tree of depth "d" is an almost complete binary tree if __________.
• The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?
• What are the worst case and average case complexities of a binary search tree?
• What are the conditions for an optimal binary search tree and what is its advantage?