New posts in Tree Balancing

The best way to calculate the height in a binary search tree? (balancing an AVL-tree)