Write a recursive function to compute the depth of a binary tree. Use the defini

Q: Write a recursive function to compute the depth of a binary tree. Use the defini

template int depth(binary_tree_node* root_ptr){ if(root_ptr == NULL){ return -1; } else{ int ld = depth(root_ptr->left); int rd = depth(root_ptr->right); int max = ld > rd ? ld : rd; return max + 1; } }

ID: 3574715 • Letter: W

Question

Write a recursive function to compute the depth of a binary tree. Use the definition of depth given in the textbook: the root of a (non-empty) tree is at depth 0; the children of the root are at depth 1; the children of a node at depth d are at depth d+1; an empty tree has depth -1; the depth of a non-empty tree is the maximum depth of any node in the tree. The prototype and the precondition/postcondition contract for the function have been written for you. template int depth(binary_tree_node* root_ptr);//Precondition: root_ptr is a pointer to the root of a binary tree.//The tree may be empty or non-empty.//Postcondition: The depth of the binary tree is returned.

Explanation / Answer

template <class Item>
int depth(binary_tree_node<Item>* root_ptr){
   if(root_ptr == NULL){
       return -1;
   }
   else{
       int ld = depth(root_ptr->left);
       int rd = depth(root_ptr->right);
       int max = ld > rd ? ld : rd;
       return max + 1;
   }
}

Navigate

Write a recursive function to calculate binomial coefficients. This function sho

Write a recursive function to get the minimum number from a sequence of numbers.

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.

Write a recursive function to compute the depth of a binary tree. Use the defini

Question

Explanation / Answer

Related Questions

Navigate