Why does function preorder $2()$ presented in the Traversal module make only half as many recursive calls as function preorder$()?$

Because there are half as many leaf nodes

Because only internal nodes get called

Because there are half as many nodes

Because half of the pointers are null