Find maximum in binary tree in C

March 19, 2025

Maximum in Binary Tree in C 

Given a binary tree, we need to find the maximum element in the binary tree. As we need to visit each node present in the tree, we can use any tree traversal or recursion. In this page, Recursion is used.

Maximum in binary tree

Find Maximum In Binary Tree In C

Algorithm :

  • If root is NULL, return minimum integer.
  • Otherwise, recursive call the function for left and right subtree.
  • Return the maximum value that is max of the right subtree, left subtree and the data present in root.
Find maximum in binary tree in C

Find size of the Binary tree

Find the height of binary tree

Check whether two tree are identical

Spiral Order traversal of Tree

Check If binary tree if Foldable or not

Code For Find The Maximum In Binary Tree In C

Run 
#include <limits.h>
#include <stdio.h>
#include <stdlib.h>

struct Node
{
  int data;
  struct Node *left, *right;
};

struct Node *newNode (int data)
{
  struct Node *node = (struct Node *) malloc (sizeof (struct Node));
  node->data = data;
  node->left = node->right = NULL;
  return (node);
}

int findMax (struct Node *root)
{
  if (root == NULL)
    return INT_MIN;

  int res = root->data;
  int lres = findMax (root->left);
  int rres = findMax (root->right);
  if (lres > res)
    res = lres;
  if (rres > res)
    res = rres;
  return res;
}

int main ()
{
  struct Node *NewRoot = NULL;
  struct Node *root = newNode (12);
  root->left = newNode (17);
  root->right = newNode (50);
  root->left->right = newNode (67);
  root->left->right->left = newNode (10);
  root->left->right->right = newNode (11);
  root->right->right = newNode (98);
  root->right->right->left = newNode (14);

  printf ("Maximum element is %d \n", findMax (root));

  return 0;
}

Output:

Maximum element is 98