CPSC 212-301 Name: _____________________________
Test #1A September 21, 2005
Honor Pledge:
I pledge that I have neither given nor received unauthorized assistance on this test.
Signed: _______________________ Date: _____________
20 points. 50 minutes. Open Java API. Open cucs API. You may not visit any other web page. You are to
develop a class called My1DTree with one constructor:
public My1DTree (int x[]) {
// ... your code ...
} // My1DTree
which receives an int array which is a one-dimensional representation of a binary tree (recall the root
element is in element 1 of of the array), and four public methods:
public String preorder () { public String inorder () {
// ... your code ... // ... your code ...
} // preorder } // inorder
public String postorder () { public String levelorder () {
// ... your code ... // ... your code ...
} // postorder } // levelorder
which return Strings containing the tree’s preorder, inorder, postorder, and levelorder traversals,
respectively.
For example, the following test driver (you may download it now from the CPSC 212 Schedule page,
September 21):
public static void main(String args[]) {
// -1 indicates that an array element is empty
int node[] = { -1, 1, 2, 3, 4, 5, 6, 7, -1, -1, -1, -1, -1 };
System.out.print("Array contents: ");
for (int i=0; i<node.length; i++)
System.out.print(node[i] + ", ");
System.out.println("");;
My1DTree t = new My1DTree(node);
System.out.println("Preorder: " + t.preorder());
System.out.println("Inorder: " + t.inorder());
System.out.println("Postorder: " + t.postorder());
System.out.println("Levelorder: " + t.levelorder());
} // end main
produces the following output:
Array contents: -1, 1, 2, 3, 4, 5, 6, 7, -1, -1, -1, -1, -1,
Preorder: 1 2 4 5 3 6 7
Inorder: 4 2 5 1 6 3 7
Postorder: 4 5 2 6 7 3 1
Levelorder: 1 2 3 4 5 6 7
