u can have a partner for this lab, but submit individually. You can read the lectures to answer the question. Download the files for this lab from blackboard (Week 8). Classes BinaryTree and BinaryNode implement a binary tree. Create an empty project in Eclipse and call it ‘BinaryTree’. Add classes: BinaryTree, BinaryNode. The main() method of BinaryTree includes test code. Read BinaryTree.java and BinaryNode.java to find out what methods are available Write a function test2() that generates a tree with 7 nodes (including root) minimum height. 2. Write a function test3() that generates a tree with 7 nodes (including root) maximum height. 3. Implement printPostOrder() for BinaryTree (you need to define the helper function in BinaryNode) 4. Implement printPreOrder() for BinaryTree (you need to define the helper function in BinaryNode comp 251
You can have a partner for this lab, but submit individually. You can read the lectures to answer the question. Download the files for this lab from blackboard (Week 8). Classes BinaryTree and BinaryNode implement a binary tree. Create an empty project in Eclipse and call it ‘BinaryTree’. Add classes: BinaryTree, BinaryNode. The main() method of BinaryTree includes test code. Read BinaryTree.java and BinaryNode.java to find out what methods are available
Write a function test2() that generates a tree with 7 nodes (including root) minimum height. 2. Write a function test3() that generates a tree with 7 nodes (including root) maximum height. 3. Implement printPostOrder() for BinaryTree (you need to define the helper function in BinaryNode) 4. Implement printPreOrder() for BinaryTree (you need to define the helper function in BinaryNode comp 251
Step by step
Solved in 4 steps with 1 images
