Question

By definition, the height of a node in a binary tree is the number of edges along the longest path from the node to any leaf. Assume the following node structure struct TreeNode! int data; node Type right; // points to right child node Type "left; // points to left child }; Write a recursive function that takes a pointer to a node in a binary tree and returns its height. Note: the height of a leaf node is o and the height of an empty tree is -1.

Answer 1

// Recursive function to find the height of a binary tree.

int height(TreeNode *root)
{
if(root==NULL)
return -1;
else
{
int left_subtree_height=height(root->left);
int right_subtree_height=height(root->right);
  
if(left_subtree_height>right_subtree_height)
return left_subtree_height;
else
return right_subtree_height;
}
}

// Funtion to display the element of the linked list in reverse order.

void reverseDisplay(nodeType *head)
{
if(head==NULL)
return;
reverseDisplay(head->next);
cout<<head->data<<" ";
  
}