470 views
2 votes
2 votes

In a binary search tree ,the key with value 5 was searched after traversing  nodes with values 1,3,4,6,7,8,9 not necessarily in that order.

Let P is the probability that 3rd element on the search path beginning from the root is either 3 or 8.and N are the number of different order possible  in which given nodes can be traversed before  finding node with value 5 .Find (N/10)+P

Please log in or register to answer this question.

Related questions

0 votes
0 votes
1 answer
1
1 votes
1 votes
1 answer
2
pradeepchaudhary asked Aug 19, 2018
19,110 views
8. What are the worst case and average case complexities of a binary search tree?a) O(n), O(n)b) O(logn), O(logn)c) O(logn), O(n)d) O(n), O(logn)
5 votes
5 votes
1 answer
3
VS asked Jan 14, 2018
932 views
A balanced binary search tree of n nodes,the number of steps needed to find and remove the 9th largest element in the worst case?(Please mention the algorithm followed)