Notes on Binary Trees.

Nice power point presentation at http://user.it.uu.se/~pierref/courses/PK3/Slides/AVLtrees.pdf.
More notes can be found at http://www.nist.gov/dads/HTML/binarytree.html.

Animated demo can be found at http://www.cs.jhu.edu/~goodrich/dsa/trees/btree.html.
Links on deleting can be found at http://www.cpp-home.com/tutorial.php?151_1, http://www.bitesizeinc.net/power.programming.binary.tree.html.

• The tree property
• Definition of "less than"
• Relation to a sorted array
• Definition of Balanced
• Several, all about different levels
• Definition of full
• Holds level^2-1 items.
• Note almost all nodes are low in the tree.
• Walking through a tree
• Pre-order
• In-order
• Post-order
  
• Non-Binary trees.
• Computationally less effecient
• Works great for disk drives (and paged RAM).