Aspects


vs


Inorder

A method of traversing binary trees, in which the node is processed after its left child, but before its right child.

Postorder

A method of traversing binary trees, in which the node is processed after its children.

Others

Quality Example
Trickier

"Postorder is trickier because the stack has to store nodes to visit and nodes to process and they aren t always simply related like they are in the inorder case"

from question "Intuitive explanation of binary tree traversals without recursion"

Back to Home
Data comes from Stack Exchange with CC-BY-SA-3.0