Related articles:
Binary tree
Depth-first search
Breadth-first search
Key terms:
node
tree
traversal
visit
null
root
inorder
stack
preorder
subtree
push
nil
postorder
binary tree
parent
if node
java
recursive
sample
each node
null then
empty
queue
haskell
iterative
data structures
expression
node left
do node
algorithms
notation
implemented
visited flag
print node
tree traversal
parent node
inorder traversal
traversal sequence
binary search tree
visit the node
threaded binary tree
space proportional
preorder traversal
postorder traversal
articles with example
traverse the left subtree
traverse the right subtree
operations recursively at each node
following operations recursively at each
perform the following operations recursively
Search external links cited by footnotes on Wikipedia page Tree traversal:
|
|