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

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.

template

int tree_depth(binary_tree_node* root_ptr)

// Precondition: root_ptr is the root pointer of a binary tree.

// Postcondition: The return value is the depth of the binary tree.

// NOTES: The empty tree has a depth of -1 and a tree with just a root

// has a depth of 0.