323 views
3 votes
3 votes
When searching for the key value 30 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?

A)21 B)42 C)35 D)2520

Please log in or register to answer this question.

No related questions found