Post order traversal¶
We start from leaves and we go up a tree, such that a node is always visited after all of its children. The root node comes last.
We start from leaves and we go up a tree, such that a node is always visited after all of its children. The root node comes last.