# tree structure search and update

Not what you're looking for?

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?

Thanks

##### Purchase this Solution

##### Solution Summary

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

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

##### Purchase this Solution

##### Free BrainMass Quizzes

##### Basic UNIX commands

Use this quiz to check your knowledge of a few common UNIX commands. The quiz covers some of the most essential UNIX commands and their basic usage. If you can pass this quiz then you are clearly on your way to becoming an effective UNIX command line user.

##### Word 2010: Tables

Have you never worked with Tables in Word 2010? Maybe it has been a while since you have used a Table in Word and you need to brush up on your skills. Several keywords and popular options are discussed as you go through this quiz.

##### Basic Networking Questions

This quiz consists of some basic networking questions.

##### Word 2010: Table of Contents

Ever wondered where a Table of Contents in a Word document comes from? Maybe you need a refresher on the topic? This quiz will remind you of the keywords and options used when working with a T.O.C. in Word 2010.

##### Java loops

This quiz checks your knowledge of for and while loops in Java. For and while loops are essential building blocks for all Java programs. Having a solid understanding of these constructs is critical for success in programming Java.