Deletion in AVL Tree
Case 3a
The node
to be deleted is in the left subtree of a parent with balance
-1
. The right subtree was balanced.
Case 4a
The node
to be deleted is in the left subtree of a parent with balance
-1
. The right subtree was unbalanced.
Case 5a
Other Uses of Binary Tree
Expression Trees
These are sometimes also called parse trees
.
Compiler Optimization
Let an expression
be (f+d*e) + ((d*e+f)*g)
, its expression tree
will be:
Notice how the circled blobs are similar? We can re-write it as: