Question

7) Recursion
Write a recursive function max_tuple(a tree which takes a tree as a parameter and returns the max values of the right and left subtree. You can assume that the parameter is a full binary tree (in a pyramid shape like with more than 3 nodes. Your solution should not have any iteration. You can use a helper function if needed. Your code should be indented correctly.
The expected return value of max_tuple(tree) for the tree below should be( 80,200)

Answer 1

There are two functions maxOfRightElement and maxOfleftElement to find maximum elements in right and left subtree.

Node* newNode(int data)
{
   Node* temp = new Node;
   temp->data = data;
   temp->left = temp->right = NULL;
   return temp;
}  
int maxOfRightElement(Node* root)
{
  
   int res = INT_MIN;
   if (root == NULL)
       return -1;

   if (root->right != NULL)
       res = root->right->data;

   return max({ maxOfRightElement(root->right),
               res,
               maxOfRightElement(root->left) });
}
int maxOfleftElement(Node* root)
{
  
   int res = INT_MIN;
   if (root == NULL)
       return -1;

   if (root->left != NULL)
       res = root->left->data;

   return max({ maxOfleftElement(root->left),
               res,
               maxOfleftElement(root->right) });
}