5.11 Tree Locking
Can beat 2PL by exploiting root-to-leaf access in a tree
If searching for a leaf, after setting a lock on a node, release the lock on its parent
wl(A) wl(B) wu(A) wl(E) wu(B)
- The lock order on the root serializes access to other nodes