Algorithms
What is the complexity of of searching in the following bst 3,2,1,6,5,4,9,8,7..,.,,,,..,n,n-1,n-2 Is it n as tge tree is right skwed and reaching to bottom takes O(n/3) steps?
What is the complexity of of searching in the following bst3,2,1,6,5,4,9,8,7..,.,,,,..,n,n-1,n-2Is it n as tge tree is right skwed and reaching to bottom takes O(n/3) ste...