Question 15144 – DSSSB TGT 2021
May 15, 2024Question 10695 – Binary-Trees
May 15, 2024Question 10744 – Binary-Trees
When searching for the key value 60 in a binary search tree, nodes containing the key values 10, 20, 40, 50, 70 80, 90 are traversed, not necessarily in the order given. How many different orders are possible in which these key values can occur on the search path from the root to the node containing the value 60?
Correct Answer: A
Question 25 Explanation:
To find 60 in BST then there are two possible set i.e., greater than 60 and smaller than 60.
Smaller values 90, 80 and 70 are visited in order
i.e., 7!/(4!3!) = 35
Smaller values 90, 80 and 70 are visited in order
i.e., 7!/(4!3!) = 35
35
64
128
5040
Subscribe
Login
0 Comments