51. What is the priority of a null node?
52. Why to prefer red-black trees over AVL trees?
53. A self - balancing binary search tree can be used to implement . . . . . . . .
54. What output does the below pseudo code produces?
Tree_node function(Tree_node x)
{
Tree_node y = x.left;
x.left = y.right;
y.right = x;
return y;
}
Tree_node function(Tree_node x)
{
Tree_node y = x.left;
x.left = y.right;
y.right = x;
return y;
}55. What is a Cartesian tree?
56. To obtain a prefix expression, which of the tree traversals is used?
57. What is the special property of red-black trees and what root should always be?
58. Find the postorder traversal of the binary tree shown below.
/1725101911-53-11.png "Binary Search Trees(B Tree) mcq question image")
59. In a full binary tree if number of internal nodes is I, then number of leaves L are?
60. Several other operations like union set difference and intersection can be done in treaps.
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.