What the tree structure buys

• A

  That every node has at most two children, bounding the work per node

• B

  That the tree is balanced, so the recursion depth stays logarithmic

• C

  That the nodes are kept sorted, so that children are always smaller than their parents

• D

  That each subproblem is reached once, because there is exactly one path between nodes