Explore BrainMass

tree structure search and update

This content was STOLEN from BrainMass.com - View the original, and get the already-completed solution here!

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 the answer and also why?


© BrainMass Inc. brainmass.com October 24, 2018, 5:50 pm ad1c9bdddf

Solution Preview

Your question is a little confusing, so I'm going to start by restating it.

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 ...

Solution Summary

What is big omega for depth x is determined. The tree structure search and update is determined.

See Also This Related BrainMass Solution

What are the differences between random hashed files and index files? Compare and contrast both these non-sequential file structure models.

Compare the two non-sequential file structure models: the random (hashed) file and the index file. What advantages does the first one have over the second and what advantages does the second have over the first? What would be your criteria for choosing one over the other for different applications?

View Full Posting Details