Skip to content
Related Articles

Related Articles

Table of Contents

Improve Article
Save Article
Like Article

Check if a Binary Tree (not BST) has duplicate values

  • Difficulty Level : Basic
  • Last Updated : 30 Jun, 2021

Check if a Binary Tree (not BST) has duplicate values
Examples: 
 

Input : Root of below tree
         1
       /   \
      2     3
             \
              2
Output : Yes
Explanation : The duplicate value is 2.

Input : Root of below tree
         1
       /   \
     20     3
             \
              4
Output : No
Explanation : There are no duplicates.

 

A simple solution is to store inorder traversal of given binary tree in an array. Then check if array has duplicates or not. We can avoid the use of array and solve the problem in O(n) time. The idea is to use hashing. We traverse the given tree, for every node, we check if it already exists in hash table. If exists, we return true (found duplicate). If it does not exist, we insert into hash table.
 

C++




// C++ Program to check duplicates
// in Binary Tree
#include <bits/stdc++.h>
using namespace std;
 
// A binary tree Node has data,
// pointer to left child
// and a pointer to right child
struct Node {
    int data;
    struct Node* left;
    struct Node* right;
};
 
// Helper function that allocates
// a new Node with the given data
// and NULL left and right pointers.
struct Node* newNode(int data)
{
    struct Node* node = new Node;
    node->data = data;
    node->left = node->right = NULL;
    return (node);
}
 
bool checkDupUtil(Node* root, unordered_set<int> &s)
{
    // If tree is empty, there are no
    // duplicates.
    if (root == NULL)
       return false;
 
    // If current node's data is already present.
    if (s.find(root->data) != s.end())
       return true;
 
    // Insert current node
    s.insert(root->data);
     
    // Recursively check in left and right
    // subtrees.
    return checkDupUtil(root->left, s) ||
           checkDupUtil(root->right, s);
}
 
// To check if tree has duplicates
bool checkDup(struct Node* root)
{
    unordered_set<int> s;
    return checkDupUtil(root, s);
}
 
// Driver program to test above functions
int main()
{
    struct Node* root = newNode(1);
    root->left = newNode(2);
    root->right = newNode(2);
    root->left->left = newNode(3);
    if (checkDup(root))
        printf("Yes");
    else
        printf("No");
 
    return 0;
}
Java



// Java Program to check duplicates
// in Binary Tree
import java.util.HashSet;
public class CheckDuplicateValues {
 
    //Function that used HashSet to find presence of duplicate nodes
    public static boolean checkDupUtil(Node root, HashSet<Integer> s)
    {
        // If tree is empty, there are no
        // duplicates. 
        if (root == null)
            return false;
   
        // If current node's data is already present.
        if (s.contains(root.data))
            return true;
   
        // Insert current node
        s.add(root.data);
       
        // Recursively check in left and right
        // subtrees.
        return checkDupUtil(root.left, s) || checkDupUtil(root.right, s);
    }
   
    // To check if tree has duplicates
    public static boolean checkDup(Node root)
    {
        HashSet<Integer> s=new HashSet<>();
        return checkDupUtil(root, s);
    }
 
    public static void main(String args[]) {
        Node root = new Node(1);
        root.left = new Node(2);
        root.right = new Node(2);
        root.left.left = new Node(3);
        if (checkDup(root))
            System.out.print("Yes");
        else
            System.out.print("No");
    }
}
 
// A binary tree Node has data,
// pointer to left child
// and a pointer to right child
class Node {
    int data;
    Node left,right;
    Node(int data)
    {
        this.data=data;
    }
};
//This code is contributed by Gaurav Tiwari
Python



""" Program to check duplicates
# in Binary Tree """
 
# Helper function that allocates a new
# node with the given data and None
# left and right poers.                                
class newNode:
 
    # Construct to create a new node
    def __init__(self, key):
        self.data = key
        self.left = None
        self.right = None
 
def checkDupUtil( root, s) :
 
    # If tree is empty, there are no
    # duplicates.
    if (root == None) :
        return False
 
    # If current node's data is already present.
    if root.data in s:
        return True
 
    # Insert current node
    s.add(root.data)
     
    # Recursively check in left and right
    # subtrees.
    return checkDupUtil(root.left, s) or checkDupUtil(root.right, s)
 
 
# To check if tree has duplicates
def checkDup( root) :
 
    s=set()
    return checkDupUtil(root, s)
 
 
# Driver Code
if __name__ == '__main__':
    root = newNode(1)
    root.left = newNode(2)
    root.right = newNode(2)
    root.left.left = newNode(3)
    if (checkDup(root)):
        print("Yes")
    else:
        print("No")
 
# This code is contributed by
# Shubham Singh(SHUBHAMSINGH10)
C#



// C# Program to check duplicates
// in Binary Tree
using System;
using System.Collections;
using System.Collections.Generic;
 
class CheckDuplicateValues
{
 
    //Function that used HashSet to
    // find presence of duplicate nodes
    public static Boolean checkDupUtil(Node root, HashSet<int> s)
    {
        // If tree is empty, there are no
        // duplicates.
        if (root == null)
            return false;
     
        // If current node's data is already present.
        if (s.Contains(root.data))
            return true;
     
        // Insert current node
        s.Add(root.data);
         
        // Recursively check in left and right
        // subtrees.
        return checkDupUtil(root.left, s) ||
                checkDupUtil(root.right, s);
    }
     
    // To check if tree has duplicates
    public static Boolean checkDup(Node root)
    {
        HashSet<int> s = new HashSet<int>();
        return checkDupUtil(root, s);
    }
 
    public static void Main(String []args)
    {
        Node root = new Node(1);
        root.left = new Node(2);
        root.right = new Node(2);
        root.left.left = new Node(3);
        if (checkDup(root))
            Console.Write("Yes");
        else
            Console.Write("No");
    }
}
 
// A binary tree Node has data,
// pointer to left child
// and a pointer to right child
public class Node
{
    public int data;
    public Node left, right;
    public Node(int data)
    {
        this.data = data;
    }
};
 
// This code is contributed by Arnab Kundu
Javascript



<script>
 
    // JavaScript Program to check duplicates in Binary Tree
     
    class Node
    {
        constructor(data) {
           this.left = null;
           this.right = null;
           this.data = data;
        }
    }
 
    // Function that used HashSet to find
    // presence of duplicate nodes
    function checkDupUtil(root, s)
    {
        // If tree is empty, there are no
        // duplicates. 
        if (root == null)
            return false;
     
        // If current node's data is already present.
        if (s.has(root.data))
            return true;
     
        // Insert current node
        s.add(root.data);
         
        // Recursively check in left and right
        // subtrees.
        return checkDupUtil(root.left, s) ||
        checkDupUtil(root.right, s);
    }
     
    // To check if tree has duplicates
    function checkDup(root)
    {
        let s = new Set();
        return checkDupUtil(root, s);
    }
     
    let root = new Node(1);
    root.left = new Node(2);
    root.right = new Node(2);
    root.left.left = new Node(3);
    if (checkDup(root))
      document.write("Yes");
    else
      document.write("No");
     
</script>
Output:  
Yes
 

My Personal Notes
arrow_drop_up
Previous
Check if a binary tree is subtree of another binary tree | Set 2
Next

Check if a Binary Tree contains duplicate subtrees of size 2 or more
Recommended Articles
Page :
K'th Largest Element in BST when modification to BST is not allowed
19, Mar 15
Iterative approach to check if a Binary Tree is BST or not
10, Dec 20
A program to check if a binary tree is BST or not
21, Nov 09
Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
20, Mar 19
Convert a Binary Tree to BST by left shifting digits of node values
20, Jan 21
Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
15, Mar 19
Check whether a binary tree is a full binary tree or not | Iterative Approach
19, Dec 17
Check whether a given binary tree is skewed binary tree or not?
18, Nov 18
Check whether a binary tree is a full binary tree or not
08, Feb 15
Convert a normal BST to Balanced BST
01, May 16
Check if a Binary Tree is BST : Simple and Efficient Approach
28, Nov 19
Check if the Binary Tree contains a balanced BST of size K
06, Jul 20
Check if a Binary Tree contains duplicate subtrees of size 2 or more
06, Mar 17
Check whether every node of binary tree has a value K on itself or its any immediate neighbours
15, Jul 20
Check if a Binary Tree is an Even-Odd Tree or not
06, Oct 20
Check whether a binary tree is a complete tree or not | Set 2 (Recursive Solution)
14, Feb 15
Count the nodes of a tree whose weighted string does not contain any duplicate characters
28, May 19
Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
19, Jan 18
Check given array of size n can represent BST of n levels or not
07, Mar 18
Check whether BST contains Dead End or not
02, Jan 17
Overview of Data Structures | Set 2 (Binary Tree, BST, Heap and Hash)
08, Feb 16
Median of all nodes from a given range in a Binary Search Tree ( BST )
03, May 21
Build Binary Tree from BST such that it's level order traversal prints sorted data
02, Jan 20
Count permutations of given array that generates the same Binary Search Tree (BST)
15, Sep 20
Article Contributed By :
https://media.geeksforgeeks.org/auth/avatar.png
Deven walia
@Deven walia
Vote for difficulty
Current difficulty :
Basic





Improved By :
Article Tags :
Practice Tags :
Report Issue

We use cookies to ensure you have the best browsing experience on our website. By using our site, you
acknowledge that you have read and understood our
Cookie Policy &
        Privacy Policy

Lightbox

Start Your Coding Journey Now!