Definitions

1. noun

an ordering of nodes in a tree or graph, where a node is visited after all its child nodes.

“The programmer used a postorder traversal to print the contents of the binary tree.”