It's not a leap, it's a return.

You start out at node 50, traverse left sequentially to nodes 17, 12, and 9.

9 has no left node, so it prints 9 and checks its right node. 9 has no right node...