Trees

This page contains information on Abstract Data Types which use a tree structure.
This includes Binary Trees, Binary Search Trees, AVL Trees, Heaps, 2-3 Trees, B-Trees, and Tries.
  1. Programming up a tree: Binary Search Tree algorithms.
  2. AVL Trees. A self-balancing binary tree.
  3. Other types of tree structures: 2-3 Trees, B-Trees, Tries