Sample Data Structures Questions Chapter 10 Trees (provide correct specific short answer in c++)

1. Using the binary_tree_node from Section 10.3, write a function to meet the following specification. You do not need to check the precondition.

template

bool all_42(binary_tree_node* root_ptr)

//Precondition: root_ptr is the root pointer of a binary tree (but NOT NECESSARILY a search tree).

//Postcondition: The return value is true if every node in the tree

// contains 42. NOTE: If the tree is empty, the function returns true.