Java Reference
In-Depth Information
110
111
112
System.out.printf(
"%s "
, node.data);
// output node data
113
}
114
}
// end class Tree
postorderHelper(node.leftNode);
// traverse left subtree
postorderHelper(node.rightNode);
// traverse right subtree
Fig. 21.17
|
TreeNode
and
Tree
class declarations for a binary search tree. (Part 4 of 4.)
1
// Fig. 21.18: TreeTest.java
2
// Binary tree test program.
3
import
java.security.SecureRandom;
4
import
com.deitel.datastructures.Tree;
5
6
public class
TreeTest
7
{
8
public static void
main(String[] args)
9
{
10
Tree<Integer> tree =
new
Tree<Integer>();
11
SecureRandom randomNumber =
new
SecureRandom();
12
13
System.out.println(
"Inserting the following values: "
);
14
15
// insert 10 random integers from 0-99 in tree
16
for
(
int
i =
1
; i <=
10
; i++)
17
{
18
int
value = randomNumber.nextInt(
100
);
19
System.out.printf(
"%d "
, value);
20
tree.insertNode(value);
21
}
22
23
System.out.printf(
"%n%nPreorder traversal%n"
);
24
tree.preorderTraversal();
25
26
System.out.printf(
"%n%nInorder traversal%n"
);
27
tree.inorderTraversal();
28
29
System.out.printf(
"%n%nPostorder traversal%n"
);
30
tree.postorderTraversal();
31
System.out.println();
32
}
33
}
// end class TreeTest
Inserting the following values:
49 64 14 34 85 64 46 14 37 55
Preorder traversal
49 14 34 46 37 64 55 85
Inorder traversal
14 34 37 46 49 55 64 85
Postorder traversal
37 46 34 14 55 85 64 49
Fig. 21.18
|
Binary tree test program.
