Definitions
from Wiktionary, Creative Commons Attribution/Share-Alike License.
- adjective computing theory Of a
tree traversal ,recursively visiting theleft andright subtrees before theroot .
Etymologies
from Wiktionary, Creative Commons Attribution/Share-Alike License
Support
Help support Wordnik (and make this page ad-free) by adopting the word postorder.
Examples
-
Right now there's a commercial on Dutch television from a local business-goods postorder company (www. overtoom.nl).
13 Unfortunate Translations That Harmed Brand Reputations 2007
-
Added new predicates preorder/2, inorder/2, and postorder/2 to the library object
MacUpdate - Mac OS X 2010
-
We could construct the tree in the obvious way, and then visit the nodes in postorder.
-
For postorder, we list a node the last time we pass it, as we move up to its parent.
-
We compute low [v] for all vertices v by visiting the vertices in a postorder traversal.
-
Suppose we have arrays PREORDER [n], INORDER [n], and POSTORDER [n] that give the preorder, inorder, and postorder positions, 3.7 respectively, of each node n of a tree.
-
Suppose we have arrays PREORDER [n], INORDER [n], and POSTORDER [n] that give the preorder, inorder, and postorder positions, 3.7 respectively, of each node n of a tree.
-
Give nonrecursive preorder, postorder, and inorder traversal algorithms that do not use \ "states\" or a stack, as Fig. 3.9 does.
-
Write a program to convert 3.13 a. a preorder listing of T into a postorder listing, b. a postorder listing of T into a preorder listing, c. a preorder listing of T into an inorder listing.
-
To test if a vertex x is a descendant of vertex y, all we need do is determine whether postorder (y) - desc (y) ≤ postorder (x) ≤ postorder (y).
Comments
Log in or sign up to get involved in the conversation. It's quick and easy.