retagged by
346 views

1 Answer

Best answer
1 votes
1 votes
In worst case that's either left or skewed.. searching number may be present at leaf node.. so for worst case it's O(n)..

For balanced binary search tree it's O(log n)..
selected by

Related questions

2 votes
2 votes
0 answers
1
4 votes
4 votes
2 answers
2
Parth Shah asked Dec 11, 2018
1,379 views
Suppose binary tree has only three nodes A,B and C, and you are given the post order traversal of tree as B-A-C . The exact pre order traversal of the tree is?A)C-A-BB)A-...
2 votes
2 votes
1 answer
3
charul asked Jan 3, 2018
387 views
i'm getting 5 but the answer given is 4