Question: Short Answers Section 10.4 Tree Traversals 9. Using the binary_tree_node from Section 10.3, Write a recursive function to meet the following specification. You do not
Short Answers Section 10.4 Tree Traversals
9. Using the binary_tree_node from Section 10.3, Write a recursive function to meet the following specification. You do not need to check the precondition.
templatevoid increase(binary_tree_node - * root_ptr) // Precondition: root_ptr is the root pointer of a binary tree. // Postcondition: Every node of the tree has had its data increased by one.
10. Using the binary_tree_node from Section 10.3, write a recursive function to meet the following specification. You do not need to check the precondition.
templatesize_t many_nodes(binary_tree_node - * root_ptr) // Precondition: root_ptr is the root pointer of a binary tree. // Postcondition: The return value is the number of nodes in the tree. // NOTES: The empty tree has 0 nodes, and a tree with just a root has // 1 node.
Step by Step Solution
There are 3 Steps involved in it
Get step-by-step solutions from verified subject matter experts
