|
|
|
|
tree traversals
|
(Algorithm)
|
|
|
This entry is broken! Please report this to the author (mps) by filing a correction. In the meantime, you can see if another rendering mode works.
|
|
(view preamble | get metadata)
See Also: tree
| Other names: |
inorder traversal |
| Also defines: |
preorder traversal, postorder traversal, in-order traversal |
|
|
Cross-references: binary search tree, right descendents, left descendents, right child, left child, nodes, children, path, edges, vertices, binary tree, necessary, tree, forest, point, root, rooted tree, algorithm
There are 3 references to this entry.
This is version 7 of tree traversals, born on 2002-02-25, modified 2006-07-24.
Object id is 2699, canonical name is TreeTraversals.
Accessed 21931 times total.
Classification:
|
|
|
|
|
|
Pending Errata and Addenda
|
|
|
|
|
|
|
|
|
|
|
