In a binary tree the search is log (x) and the update is x where x is teh depth of the tree. Is this correct? In tree like structure (tree structure) what is the maximum number of access for record update? is it x? why? what about the search?
I need teh answer and also why?
Your question is a little confusing, so I'm going to start by restating it.
<br>Let n be the number of nodes in a balanced binary search tree. Then the height of the tree, h, is log(n). As a result, the search operation on this tree is ...
What is big omega for depth x?