- postorder traverse
- обход в обратном порядке, обход в глубину
Большой англо-русский и русско-английский словарь. 2001.
postorder traverse
Смотреть что такое "postorder traverse" в других словарях:
Tree traversal — Graph and tree search algorithms Alpha beta pruning A* B* Beam Bellman–Ford algorithm Best first Bidirectional … Wikipedia
Adaptations of The Lord of the Rings — This article is about the films and other media. For the article on the musical, see The Lord of the Rings (musical) The Lord of the Rings , an epic high fantasy novel by the British author J. R. R. Tolkien, set in his fictional world of Middle… … Wikipedia
Binary search tree — In computer science, a binary search tree (BST) is a binary tree data structurewhich has the following properties: *each node (item in the tree) has a value; *a total order (linear order) is defined on these values; *the left subtree of a node… … Wikipedia
Compiere — Developer(s) Consona Corporation Stable release 3.3 / March 24, 2009; 2 years ago (2009 03 24) Operating system Unix like, Microsoft Windows … Wikipedia
Sethi-Ullman algorithm — When generating code for arithmetic expressions, the compiler has to decide which is the best way to translate the expression in terms of number of instructions used as well as number of registers needed to evaluate a certain subtree (especially… … Wikipedia
