Java Reference
In-Depth Information
d. Which node is the root of the tree?
e. Which node(s) are the sibling(s) of the node storing the value 2 ? Which nodes are its children?
3
5
2
1
4
6
Section 17.2:Tree Traversals
For each of the next three problems, write the elements of the given tree in the order in which they would be seen by a
preorder, inorder, and postorder traversal.
4.
3
5
2
1
4
6
5.
19
47
63
23
-2
94
55
28
6.
2
1
7
6
4
9
3
5
8
Search WWH ::




Custom Search