What should the return type be in each of the following methods? getData() --> getLeft() --> getRight() --> 2. What should the parameter type be in each of the following methods? setData() --> setLeft() --> setRight() --> 3. What would need to be added/removed/changed to make this class work for a more general tree such that each node could have more than 2 nodes? EXERCISE 2 4. What is the base case of the size() method? What are the recursive cases? 5. What is the main difference between the 3 methods: inorder(), preorder(), and postorder()? 6. In the recFormatTree() method, what is the space parameter used for? What is the default value when this method is first called? What is being concatenated to this space value in the recursive calls? Does this make sense for how the tree is being displayed? EXERCISE 3 7. How can you tell if a given node is a leaf node? No hand written solution and no image
What should the return type be in each of the following methods? getData() --> getLeft() --> getRight() -->
2. What should the parameter type be in each of the following methods? setData() --> setLeft() --> setRight() -->
3. What would need to be added/removed/changed to make this class work for a more general tree such that each node could have more than 2 nodes? EXERCISE 2
4. What is the base case of the size() method? What are the recursive cases?
5. What is the main difference between the 3 methods: inorder(), preorder(), and postorder()?
6. In the recFormatTree() method, what is the space parameter used for? What is the default value when this method is first called? What is being concatenated to this space value in the recursive calls? Does this make sense for how the tree is being displayed? EXERCISE 3
7. How can you tell if a given node is a leaf node? No hand written solution and no image
Step by step
Solved in 2 steps