If a node has two children, it can lead to a maximum of 3 leaf nodes in its subtree, assuming each child has at least one leaf.

The in-order traversal visits the left subtree, then the root, and then the right subtree, resulting in B, A, C, D.

In level-order traversal, nodes are visited level by level from top to bottom, resulting in A, B, C.

In post-order traversal, the left subtree is visited first, then the right subtree, and finally the root, resulting in B, C, A.

Depth-first search (DFS) is typically implemented using a stack.