Adjective
post-order (not comparable)
(computing theory) Alternative spelling of postorder
A post-order traversal is used to process the contents of a trie in descending order. Source: Internet
Note that some algorithms (such as post-order depth-first search) begin at the root, but first visit leaf nodes (access the value of leaf nodes), only visit the root last (i. Source: Internet
Traversal main Pre-order, in-order, and post-order traversal visit each node in a tree by recursively visiting each node in the left and right subtrees of the root. Source: Internet