In the balanced binary tree in Fig. given below, how many nodes will become unbalanced when a node is inserted as a child of the node “g”?

A binary search tree is generated by inserting in order the following integers: 50, 15, 62, 5, 20, 58, 91, 3, 8, 37, 60, 24 The number of nodes in the left subtree and right subtree of the root respectively is

An advantage of chained hash table (external hashing) over the open addressing scheme is

A binary search tree is used to locate the number 43. Which of the following probe sequences are not possible?