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; } |
chevron_right
filter_none
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 |
chevron_right
filter_none
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) |
chevron_right
filter_none
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 |
chevron_right
filter_none
Output:
Yes
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.
Recommended Posts:
- A program to check if a binary tree is BST or not
- Maximum sub-tree sum in a Binary Tree such that the sub-tree is also a BST
- K'th Largest Element in BST when modification to BST is not allowed
- Check if the given binary tree has a sub-tree with equal no of 1's and 0's | Set 2
- Check whether a binary tree is a full binary tree or not
- Check whether a binary tree is a full binary tree or not | Iterative Approach
- Check whether a given binary tree is skewed binary tree or not?
- Check if a Binary Tree contains duplicate subtrees of size 2 or more
- Check if a Binary Tree is BST : Simple and Efficient Approach
- Check if the Binary Tree contains a balanced BST of size K
- Convert a normal BST to Balanced BST
- Check whether every node of binary tree has a value K on itself or its any immediate neighbours
- Count the nodes of a tree whose weighted string does not contain any duplicate characters
- Check whether a binary tree is a complete tree or not | Set 2 (Recursive Solution)
- Check if a Binary Tree is an Even-Odd Tree or not
- Complexity of different operations in Binary tree, Binary Search Tree and AVL tree
- Duplicate subtree in Binary Tree | SET 2
- Check if a binary tree is subtree of another binary tree | Set 1
- Check if a binary tree is subtree of another binary tree | Set 2
- Check if a binary tree is subtree of another binary tree using preorder traversal : Iterative
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to contribute@geeksforgeeks.org. See your article appearing on the GeeksforGeeks main page and help other Geeks.
Please Improve this article if you find anything incorrect by clicking on the "Improve Article" button below.
