Skip to content
Related Articles

Related Articles

Improve Article

Maximum difference between node and its ancestor in Binary Tree

  • Difficulty Level : Medium
  • Last Updated : 10 May, 2021

Given a binary tree, we need to find maximum value we can get by subtracting value of node B from value of node A, where A and B are two nodes of the binary tree and A is an ancestor of B. Expected time complexity is O(n).
For example, consider below binary tree 
 

tree

We can have various ancestor-node difference, some of which are given below : 
8 – 3 = 5 
3 – 7 = -4 
8 – 1 = 7 
10 – 13 = -3 
. . . .
But among all those differences maximum value is 7 obtained by subtracting 1 from 8, which we need to return as result.
 

As we are given a binary tree, there is no relationship between node values so we need to traverse whole binary tree to get max difference and we can obtain the result in one traversal only by following below steps : 
If we are at leaf node then just return its value because it can’t be ancestor of any node. Then at each internal node we will try to get minimum value from left subtree and right subtree and calculate the difference between node value and this minimum value and according to that we will update the result. 
As we are calculating minimum value while retuning in recurrence we will check all optimal possibilities (checking node value with minimum subtree value only) of differences and hence calculate the result in one traversal only.
Below is the implementation of above idea. 
 

C++




// C++ program to find maximum difference between node
// and its ancestor
#include <bits/stdc++.h>
using namespace std;
 
/* A binary tree node has key, pointer to left
   child and a pointer to right child */
struct Node
{
    int key;
    struct Node* left, *right;
};
 
/* To create a newNode of tree and return pointer */
struct Node* newNode(int key)
{
    Node* temp = new Node;
    temp->key = key;
    temp->left = temp->right = NULL;
    return (temp);
}
 
/* Recursive function to calculate maximum ancestor-node
   difference in  binary tree. It updates value at 'res'
   to store the result.  The returned value of this function
   is minimum value in subtree rooted with 't' */
int maxDiffUtil(Node* t, int *res)
{
    /* Returning Maximum int value if node is not
       there (one child case)  */
    if (t == NULL)
        return INT_MAX;
 
    /* If leaf node then just return node's value  */
    if (t->left == NULL && t->right == NULL)
        return t->key;
 
    /* Recursively calling left and right subtree
       for minimum value  */
    int val = min(maxDiffUtil(t->left, res),
                  maxDiffUtil(t->right, res));
 
    /* Updating res if (node value - minimum value
       from subtree) is bigger than res  */
    *res = max(*res, t->key - val);
 
    /* Returning minimum value got so far */
    return min(val, t->key);
}
 
/* This function mainly calls maxDiffUtil() */
int maxDiff(Node *root)
{
    // Initialising result with minimum int value
    int res = INT_MIN;
 
    maxDiffUtil(root, &res);
 
    return res;
}
 
/* Helper function to print inorder traversal of
  binary tree   */
void inorder(Node* root)
{
    if (root)
    {
        inorder(root->left);
        printf("%d ", root->key);
        inorder(root->right);
    }
}
 
// Driver program to test above functions
int main()
{
    // Making above given diagram's binary tree
    Node* root;
    root = newNode(8);
    root->left = newNode(3);
 
    root->left->left = newNode(1);
    root->left->right = newNode(6);
    root->left->right->left = newNode(4);
    root->left->right->right = newNode(7);
 
    root->right = newNode(10);
    root->right->right = newNode(14);
    root->right->right->left = newNode(13);
 
    printf("Maximum difference between a node and"
           " its ancestor is : %d\n", maxDiff(root));
}

Java




/* Java program to find maximum difference between node
   and its ancestor */
  
// A binary tree node has key, pointer to left
// and right child
class Node
{
    int key;
    Node left, right;
  
    public Node(int key)
    {
        this.key = key;
        left = right = null;
    }
}
  
/* Class Res created to implement pass by reference
   of 'res' variable */
class Res
{
    int r = Integer.MIN_VALUE;
}
  
public class BinaryTree
{
    Node root;
  
    /* Recursive function to calculate maximum ancestor-node
       difference in  binary tree. It updates value at 'res'
       to store the result.  The returned value of this function
       is minimum value in subtree rooted with 't' */
    int maxDiffUtil(Node t, Res res)
    {
        /* Returning Maximum int value if node is not
           there (one child case)  */
        if (t == null)
            return Integer.MAX_VALUE;
          
        /* If leaf node then just return node's value  */
        if (t.left == null && t.right == null)
            return t.key;
  
        /* Recursively calling left and right subtree
           for minimum value  */
        int val = Math.min(maxDiffUtil(t.left, res),
                maxDiffUtil(t.right, res));
  
        /* Updating res if (node value - minimum value
           from subtree) is bigger than res  */
        res.r = Math.max(res.r, t.key - val);
  
        /* Returning minimum value got so far */
        return Math.min(val, t.key);
    }
  
    /* This function mainly calls maxDiffUtil() */
    int maxDiff(Node root)
    {
        // Initialising result with minimum int value
        Res res = new Res();
        maxDiffUtil(root, res);
  
        return res.r;
    }
  
    /* Helper function to print inorder traversal of
       binary tree   */
    void inorder(Node root)
    {
        if (root != null)
        {
            inorder(root.left);
            System.out.print(root.key + "");
            inorder(root.right);
        }
    }
  
    // Driver program to test the above functions
    public static void main(String[] args)
    {
        BinaryTree tree = new BinaryTree();
  
        // Making above given diagram's binary tree
        tree.root = new Node(8);
        tree.root.left = new Node(3);
        tree.root.left.left = new Node(1);
        tree.root.left.right = new Node(6);
        tree.root.left.right.left = new Node(4);
        tree.root.left.right.right = new Node(7);
  
        tree.root.right = new Node(10);
        tree.root.right.right = new Node(14);
        tree.root.right.right.left = new Node(13);
  
        System.out.println("Maximum difference between a node and"
                + " its ancestor is : " + tree.maxDiff(tree.root));
    }
}
  
// This code has been contributed by Mayank Jaiswal(mayank_24)

Python3




# Python3 program to find maximum difference
# between node and its ancestor
 
_MIN = -2147483648
_MAX = 2147483648
 
# Helper function that allocates a new
# node with the given data and None left
# and right poers.                                    
class newNode:
 
    # Constructor to create a new node
    def __init__(self, key):
        self.key = key
        self.left = None
        self.right = None
 
"""
Recursive function to calculate maximum
ancestor-node difference in binary tree.
It updates value at 'res' to store the
result. The returned value of this function
is minimum value in subtree rooted with 't' """
def maxDiffUtil(t, res):
 
    """ Returning Maximum value if node
    is not there (one child case) """
    if (t == None):
        return _MAX, res
 
    """ If leaf node then just return
        node's value """
    if (t.left == None and t.right == None):
        return t.key, res
 
    """ Recursively calling left and right
    subtree for minimum value """
    a, res = maxDiffUtil(t.left, res)
    b, res = maxDiffUtil(t.right, res)
    val = min(a, b)
 
    """ Updating res if (node value - minimum
    value from subtree) is bigger than res """
    res = max(res, t.key - val)
     
    """ Returning minimum value got so far """
    return min(val, t.key), res
 
""" This function mainly calls maxDiffUtil() """
def maxDiff(root):
 
    # Initialising result with minimum value
    res = _MIN
    x, res = maxDiffUtil(root, res)
    return res
 
""" Helper function to print inorder
traversal of binary tree """
def inorder(root):
 
    if (root):
     
        inorder(root.left)
        prf("%d ", root.key)
        inorder(root.right)
     
# Driver Code
if __name__ == '__main__':
     
    """
    Let us create Binary Tree shown
    in above example """
    root = newNode(8)
    root.left = newNode(3)
 
    root.left.left = newNode(1)
    root.left.right = newNode(6)
    root.left.right.left = newNode(4)
    root.left.right.right = newNode(7)
 
    root.right = newNode(10)
    root.right.right = newNode(14)
    root.right.right.left = newNode(13)
    print("Maximum difference between a node and",
          "its ancestor is :", maxDiff(root))
     
# This code is contributed by
# Shubham Singh(SHUBHAMSINGH10)

C#




using System;
 
/* C# program to find maximum difference between node
   and its ancestor */
 
// A binary tree node has key, pointer to left 
// and right child 
public class Node
{
    public int key;
    public Node left, right;
 
    public Node(int key)
    {
        this.key = key;
        left = right = null;
    }
}
 
/* Class Res created to implement pass by reference
   of 'res' variable */
public class Res
{
    public int r = int.MinValue;
}
 
public class BinaryTree
{
    public Node root;
 
    /* Recursive function to calculate maximum ancestor-node
       difference in  binary tree. It updates value at 'res'
       to store the result.  The returned value of this function
       is minimum value in subtree rooted with 't' */
    public virtual int maxDiffUtil(Node t, Res res)
    {
        /* Returning Maximum int value if node is not
           there (one child case)  */
        if (t == null)
        {
            return int.MaxValue;
        }
 
        /* If leaf node then just return node's value  */
        if (t.left == null && t.right == null)
        {
            return t.key;
        }
 
        /* Recursively calling left and right subtree
           for minimum value  */
        int val = Math.Min(maxDiffUtil(t.left, res), maxDiffUtil(t.right, res));
 
        /* Updating res if (node value - minimum value
           from subtree) is bigger than res  */
        res.r = Math.Max(res.r, t.key - val);
 
        /* Returning minimum value got so far */
        return Math.Min(val, t.key);
    }
 
    /* This function mainly calls maxDiffUtil() */
    public virtual int maxDiff(Node root)
    {
        // Initialising result with minimum int value
        Res res = new Res();
        maxDiffUtil(root, res);
 
        return res.r;
    }
 
    /* Helper function to print inorder traversal of
       binary tree   */
    public virtual void inorder(Node root)
    {
        if (root != null)
        {
            inorder(root.left);
            Console.Write(root.key + "");
            inorder(root.right);
        }
    }
 
    // Driver program to test the above functions
    public static void Main(string[] args)
    {
        BinaryTree tree = new BinaryTree();
 
        // Making above given diagram's binary tree
        tree.root = new Node(8);
        tree.root.left = new Node(3);
        tree.root.left.left = new Node(1);
        tree.root.left.right = new Node(6);
        tree.root.left.right.left = new Node(4);
        tree.root.left.right.right = new Node(7);
 
        tree.root.right = new Node(10);
        tree.root.right.right = new Node(14);
        tree.root.right.right.left = new Node(13);
 
        Console.WriteLine("Maximum difference between a node and" + " its ancestor is : " + tree.maxDiff(tree.root));
    }
}
 
  // This code is contributed by Shrikant13

Javascript




<script>
/* javascript program to find maximum difference between node
   and its ancestor */
 
// A binary tree node has key, pointer to left
// and right child
class Node {
    constructor(key) {
        this.key = key;
        this.left = this.right = null;
    }
}
 
/*
 * Class Res created to implement pass by reference of 'res' variable
 */
class Res {
constructor(){
    this.r = Number.MIN_VALUE;
    }
}
 
var root;
 
    /*
     * Recursive function to calculate maximum ancestor-node difference in binary
     * tree. It updates value at 'res' to store the result. The returned value of
     * this function is minimum value in subtree rooted with 't'
     */
    function maxDiffUtil( t,  res) {
        /*
         * Returning Maximum var value if node is not there (one child case)
         */
        if (t == null)
            return Number.MAX_VALUE;
 
        /* If leaf node then just return node's value */
        if (t.left == null && t.right == null)
            return t.key;
 
        /*
         * Recursively calling left and right subtree for minimum value
         */
        var val = Math.min(maxDiffUtil(t.left, res), maxDiffUtil(t.right, res));
 
        /*
         * Updating res if (node value - minimum value from subtree) is bigger than res
         */
        res.r = Math.max(res.r, t.key - val);
 
        /* Returning minimum value got so far */
        return Math.min(val, t.key);
    }
 
    /* This function mainly calls maxDiffUtil() */
    function maxDiff( root) {
        // Initialising result with minimum var value
         res = new Res();
        maxDiffUtil(root, res);
 
        return res.r;
    }
 
    /*
     * Helper function to prvar inorder traversal of binary tree
     */
    function inorder( root) {
        if (root !=null) {
            inorder(root.left);
            document.write(root.key + "");
            inorder(root.right);
        }
    }
 
    // Driver program to test the above functions
     
 
 
        // Making above given diagram's binary tree
        root = new Node(8);
        root.left = new Node(3);
        root.left.left = new Node(1);
        root.left.right = new Node(6);
        root.left.right.left = new Node(4);
        root.left.right.right = new Node(7);
 
        root.right = new Node(10);
        root.right.right = new Node(14);
        root.right.right.left = new Node(13);
 
        document.write("Maximum difference between a node and"
        + " its ancestor is : " + maxDiff(root));
 
// This code contributed by umadevi9616
</script>

Output : 



Maximum difference between a node and its ancestor is : 7 

 

?list=PLqM7alHXFySHCXD7r1J0ky9Zg_GBB1dbk 
This article is contributed by Utkarsh Trivedi. Please write comments if you find anything incorrect, or you want to share more information about the topic discussed above
 

Attention reader! Don’t stop learning now. Get hold of all the important DSA concepts with the DSA Self Paced Course at a student-friendly price and become industry ready.  To complete your preparation from learning a language to DS Algo and many more,  please refer Complete Interview Preparation Course.

In case you wish to attend live classes with experts, please refer DSA Live Classes for Working Professionals and Competitive Programming Live for Students.




My Personal Notes arrow_drop_up
Recommended Articles
Page :