8
Traversal Three types Pre-order Visit the parent before either of its children In-order Visit the left children before the parent Visit the right children after Post-order Visit the children before the parent

11
All keys in left subtree <= root All keys in right subtree >= root In-order traversal => non-decreasing list Tree-sort O(n log n) build time for balanced trees O(n) time to traverse tree Can define functions to find particular items or the largest or smallest item