Q1➡| A binary tree T has n leaf nodes. The number of nodes of degree 2 in T is
i ā„ Log2n
ii ā„ n-1
iii ā„ n
iv ā„ 2n
Q2➡| In the balanced binary tree in the below figure, how many nodes will become unbalanced when a node is inserted as a child of the node āgā?
i ā„ 1
ii ā„ 3
iii ā„ 7
iv ā„ 8
Q3➡| Which of the following sequences denotes the post order traversal sequence of the given tree?
i ā„ f e g c d b a
ii ā„ g c b d a f e
iii ā„ g c d b f e a
iv ā„ f e d g c b a
Q4➡| 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
i ā„ (4, 7)
ii ā„ (7, 4)
iii ā„ (8, 3)
iv ā„ (3, 8)
Q5➡| A binary search tree is used to locate the number 43. Which one of the following probe sequence is not possible?
3-iii
4-ii
5-2
1, iv
2, ii
3, iii
4, ii
5, iv
1: ii
2: ii
3: iii
4: ii
5: iii