Algorithms on Trees
shape: binary tree, full binary tree, complete binary tree
order: heap, binary search tree (BST), balanced BST (AVL tree, Red-Black tree, applet), B-Tree (applet)
storage: tree as linked nodes, heap in array
search: order? shape? Θ(n) or Θ(lg n)
insertion and deletion: shape and order, Θ(n) or Θ(lg n)
sorting: tree building (with order/shape) followed by deletion or traversal (e.g., heap, BST), Θ(n2) or Θ(n lg n)
BST with size information for dynamic order statistics
Efficiency of operations (search, insert, delete, traversal, sorting) in various data structures (shape, order)