| | |
Binary Search Trees
![]() |
•
•
•
•
Originally Posted by LearninKaz
Hey,
I need help with finding out if BSTs are height and size balanced, Ive got plenty of books and people telling me different things but i need it to click in my own head! Any ideas or simple ways of doing it?
Thankyas!
*Voted best profile in the world*
•
•
Join Date: Aug 2006
Posts: 2
Reputation:
Solved Threads: 0
apparently, a search tree is size balanced if the numbers of the nodes in the left and right subtrees of every node differ by no more than one. and height balanced (AVL balanced) if the heights of the left and right subtrees of every node differ by no more than one.
Confusing! I was just wondering if anyone had any tips or tricks
Confusing! I was just wondering if anyone had any tips or tricks
:confused: Karen;)
•
•
Join Date: Aug 2005
Posts: 148
Reputation:
Solved Threads: 6
•
•
•
•
Originally Posted by LearninKaz
apparently, a search tree is size balanced if the numbers of the nodes in the left and right subtrees of every node differ by no more than one. and height balanced (AVL balanced) if the heights of the left and right subtrees of every node differ by no more than one.
Confusing! I was just wondering if anyone had any tips or tricks
![]() |
Similar Threads
- binary search trees (Java)
- please help me: build a binary search tree by Lisp (Legacy and Other Languages)
- Binary search tree removal (C++)
- Help with Tertiary trees?!?! (Java)
- binary search (C++)
- Insertion in a binary search tree (C++)
Other Threads in the C Forum
- Previous Thread: plz suggest me how to do this program
- Next Thread: How to do text fade in and fade out effect
| Thread Tools | Search this Thread |
* ansi api array arrays bash binarysearch calculate centimeter changingto char character convert copyanyfile copypdffile createcopyoffile createprocess() directory dynamic execv fflush file floatingpointvalidation fork forloop frequency function getlasterror getlogicaldrivestrin givemetehcodez grade graphics gtkgcurlcompiling gtkwinlinux hardware highest histogram homework i/o ide inches include infiniteloop initialization input intmain() iso keyboard km license linked linkedlist linux list looping loopinsideloop. lowest matrix microsoft mysql oddnumber open opendocumentformat openwebfoundation pdf pointer pointers posix power program programming pyramidusingturboccodes read recursion recv recvblocked repetition reversing scanf scheduling segmentationfault send shape single socketprogramming stack standard strchr string suggestions test threads unix urboc user variable whythiscodecausesegmentationfault win32api windows.h windowsapi






