Databases
StackOverflow2013
Postsdbo
POThe best way to calculate the height in a binary search tree? (balancing an AVL-tree)
 

Note that there are some explanatory texts on larger screens.

plurals
  1. POThe best way to calculate the height in a binary search tree? (balancing an AVL-tree)
    primarykey
    data
    text
    <p>I'm looking for the best way to calculate a nodes balance in an <a href="http://en.wikipedia.org/wiki/AVL_tree" rel="noreferrer">AVL-tree</a>. I thought I had it working, but after some heavy inserting/updating I can see that it's not working correct (at all). </p> <p>This is kind of a two-part question, the first part would be how to calculate the height of a sub-tree, I know the definition <em>"The height of a node is the length of the longest downward path to a leaf from that node."</em> and I understand it, but I fail at implementing it. And to confuse me further this quote can be found on wikipedia on tree-heights <em>"Conventionally, the value -1 corresponds to a subtree with no nodes, whereas zero corresponds to a subtree with one node."</em></p> <p>And the second part is getting the balance factor of a sub-tree in an AVL tree, I've got no problem understanding the concept, <em>"get the height of your <code>L</code> and <code>R</code> sub-trees and subtract <code>R</code> from <code>L</code>"</em>. And this is defined as something like this: <code>BALANCE = NODE[L][HEIGHT] - NODE[R][HEIGT]</code></p> <p>Reading on wikipedia says this on the first few lines describing insertions into an AVL tree: <em>"If the balance factor becomes -1, 0, or 1 then the tree is still in AVL form, and no rotations are necessary."</em></p> <p>It then goes on, saying this <em>"If the balance factor becomes 2 or -2 then the tree rooted at this node is unbalanced, and a tree rotation is needed. At most a single or double rotation will be needed to balance the tree."</em> - which I have no trouble grasping. </p> <p>But (yes, there's always a but).</p> <p>Here's where it gets confusing, the text states <em>"If the balance factor of R is 1, it means the insertion occurred on the (external) right side of that node and a left rotation is needed"</em>. But from m understanding the text said (as I quoted) that if the balance factor was within <code>[-1, 1]</code> then there was no need for balancing? </p> <p>I feel I'm so close to grasping the concept, I've gotten the tree rotations down, implemented a normal binary search tree, and on the brink of grasping AVL-trees but just seem to be missing that essential epiphany.</p> <p><strong>Edit:</strong> Code examples are preferred over academic formulas as I've always had an easier time grasping something in code, but any help is greatly appreciated.</p> <p><strong>Edit:</strong> I wish I could mark all answers as "accepted", but for me NIck's answer was the first that made me go "aha".</p>
    singulars
    1. PO
      singulars
      1. PTAnswer
    1. This table or related slice is empty.
    1. PTQuestion
    1. USKara
    1. USthr
    plurals
    1. This table or related slice is empty.
    1. PL
      singulars
      1. LTLinked
    2. PL
      singulars
      1. LTLinked
    1. This table or related slice is empty.
    1. PO
      singulars
      1. PTAnswer
    2. PO
      singulars
      1. PTAnswer
    3. PO
      singulars
      1. PTAnswer
    1. VO
      singulars
      1. POThe best way to calculate the height in a binary search tree? (balancing an AVL-tree)
      1. USthr
      1. VTFavorite
    2. VO
      singulars
      1. POThe best way to calculate the height in a binary search tree? (balancing an AVL-tree)
      1. USX-Istence
      1. VTFavorite
    3. VO
      singulars
      1. POThe best way to calculate the height in a binary search tree? (balancing an AVL-tree)
      1. This table or related slice is empty.
      1. VTUpMod
    1. This table or related slice is empty.
 

Querying!

 
Guidance
A row detail

Detail views are divided into sections. All the information in the data section comes from columns in the selected row. The other sections display data from other, related rows.

Related data can be related in a to-one or a to-many fashion. Captions of data related in a to-many fashion link to a list view showing a filtered view of the table.

Try moving around until you find a non-empty to-many entry and click on the label to get to one. You can move back to the root by clicking on the database name in the header.

SQuiL has stopped working due to an internal error.

If you are curious you may find further information in the browser console, which is accessible through the devtools (F12).

Reload