Solved

binary search tree

Posted on 2000-04-26
5
309 Views
Last Modified: 2013-11-15
                                         70
                                             \
                                               \
                                              80
                                           /      \
                                         /          \
                                       85        100
                                      /  \          /   \
                                    /     \        /      \
                                 65     88    90     110

my question is this a binary search tree?? i say no, am i right?

given the level of every node, what is the height of the tree?
0
Comment
Question by:beachbumm
[X]
Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

  • Help others & share knowledge
  • Earn cash & points
  • Learn & ask questions
5 Comments
 
LVL 16

Expert Comment

by:imladris
ID: 2752563
It's a binary tree. I would be inclined to indicate whether the tree can be USED for searching or not. To use a tree for searching (efficiently) the tree must be ordered. That requires that all nodes to the right of any particular node be "greater" and all nodes to the left be "lesser" than the that node (where greater and lesser could be defined in various ways, in the general case, depending on the data that is being used).
This tree fails that criterion in that 65 is to the right of 70, as is 80. One is less, the other is more, so the tree is not in order.
If it is in order, then when you are searching for a particular node, you can easily determine which node to inspect next, depending on whether the node you want is greater or lesser than the one you are currently considering.

The height would appear to be 4.
0
 

Author Comment

by:beachbumm
ID: 2752667
i agree with you that this is not a binary search tree but when i state the level of every node and height is this 1,2,3,3,4,4,4,4; 4 or is it 0,1,2,2,3,3,3,3; 4?
0
 
LVL 5

Accepted Solution

by:
Jan Louwerens earned 10 total points
ID: 2752705
the height of the tree is 4.
the levels of each node are (top down, left to right) 1,2,3,3,4,4,4,4
0
 
LVL 1

Expert Comment

by:mournblade
ID: 2752708
looks like homework questions to me...

all your questions are so simple and academic in nature: you should read your C++ and Data structures books more carefully. all those answers can be found in any beginners' books about these subjects...
0
 

Author Comment

by:beachbumm
ID: 2752778
comment about these being homework questions...i am 30 and by far not in school, but do take that as a compliment! im self teaching myself the C language as to one day be able to write programs for the business i own. these questions are exercises out of a book and sometimes i need assistance in how the answer is achieved for my own knowledge.
0

Featured Post

MS Dynamics Made Instantly Simpler

Make Your Microsoft Dynamics Investment Count  & Drastically Decrease Training Time by Providing Intuitive Step-By-Step WalkThru Tutorials.

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

Skype is a P2P (Peer to Peer) instant messaging and VOIP (Voice over IP) service – as well as a whole lot more.
There are many software programs on offer that will claim to magically speed up your computer. The best advice I can give you is to avoid them like the plague, because they will often cause far more problems than they solve. Try some of these "do it…
This video shows how use content aware, what it’s used for, and when to use it over other tools.
An overview on how to enroll an hourly employee into the employee database and how to give them access into the clock in terminal.

739 members asked questions and received personalized solutions in the past 7 days.

Join the community of 500,000 technology professionals and ask your questions.

Join & Ask a Question