Post-Order Traversal

noun

say it: “POHST OR-der truh-VUR-sul” /poʊst ˈɔrdɚ trəˈvɝsəl/

A tree walk that visits each node after its children, the order for adding up sizes or deleting a folder.

What is a post-order traversal?

A post-order traversal walks all of a node's children first and visits the node last, so the root comes at the very end. It's the order for totals, like a folder's size, where the parts must be ready before the whole.

In a sentence

  • “Adding up each folder's size is a post-order traversal, because a folder's total needs its contents' totals first.”

Level: Journeyman · More Data Structures terms at this level

Updated