Binary Search Trees

• Balanced tree: each node has approximately as many descendants on the left as on the right
• If a binary search tree is balanced, then adding an element takes O(log(n)) time
• If the tree is unbalanced, insertion can be slow
  • Perhaps as slow as insertion into a linked list