508 views
0 votes
0 votes
When searching for the key value 50 in a binary search tree, nodes containing the key values 10,15,20,30,60,80,89,90 are traversed, not necessarily in the given order. 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 50?

Please log in or register to answer this question.

Related questions

0 votes
0 votes
0 answers
1
–1 votes
–1 votes
0 answers
3
Avik Chowdhury asked Sep 2, 2018
309 views
HOW TO SOLVE IT?