Computer Science Homework Solutions
Problem
#22253

tree structure search and update; what is big omega for depth x?

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?

Thanks

Solution
What is this?
By OTA - Overall OTA Rating
William Springer, MS - 4.4/5
Purchase Cost Now
$2.19 CAD (was ~$15.96)
Included in Download
  • Plain text response
$2.19 Instant Download
Add to Cart
Why you can trust BrainMass.com
  • Your Information is Secure
  • Best Online Academic Help Service
  • Students find real academic Success
Related Solutions
  • Binary Tree Tree worst case scenario - We know that binary trees are O(n) for these dictionary operations... What is the worst case input scenario for each operation (i.e. a list of numbers in reverse order...) Binary Tree ----------- ...
  • Queries in Access - I notice when writing queries that Access will add in a semicolon at the end of my query. Its just one of those Access things right? We don't have to remember to write the semicolon, as Access adds it ...
  • Design a hashed file - Design a hashed file of words that could be used as a spell checker. What would you use as a hash function? Would your choice of a hash function depend on the language from which the words are chosen ...
  • Access - Wildcards: - Here's what Access says about searching for wildcards: When using wildcard characters to search for other wildcard characters such as an asterisk (*), question mark (?), number sign (#), openi ...
  • Data Structure C++ - 1. Describe a mechanism to access the telephone customer records by telephone #. Assume that we have a huge data in hand, say a million records or so. Choose a data structure (or) a combination of da ...
Browse