• Skip to primary navigation
  • Skip to content
  • Skip to primary sidebar
  • Skip to secondary sidebar

GoHired

Interview Questions asked in Google, Microsoft, Amazon

Join WeekEnd Online Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

  • Home
  • Best Java Books
  • Algorithm
  • Internship
  • Certificates
  • About Us
  • Contact Us
  • Privacy Policy
  • Array
  • Stack
  • Queue
  • LinkedList
  • DP
  • Strings
  • Tree
  • Mathametical
  • Puzzles
  • Graph

Handle duplicates in Binary Search Tree

April 17, 2017 by Dhaval Dave

In a Binary Search Tree (BST), all keys in left subtree of a key must be smaller and all keys in right subtree must be greater. So a Binary Search Tree by definition has distinct keys and duplicates in binary search tree are not allowed.

How to allow duplicates where every insertion inserts one more key with a value and every deletion deletes one occurrence?

A Simple Solution is to allow same keys with count. For example consider insertion of keys 3, 6, 7, 8, 8, 8, 10, 12, 12 in an empty Binary Search Tree

         8(3)
       /     \      
    6(1)      10(1)
  /    \        \
3(1)    7(1)     12(2)

This count store requires changing the structure of Binary Search tree to

struct node
{
    int key;
    int count;
    struct node *left, *right;
};

And We may need to change the code of Functions of “Insert” “Find” and “Delete”.

Lets see for Insert

struct node* insert(struct node* node, int key)
{
    if (node == NULL) return newNode(key);
 
    if (key == node->key)
    {
       (node->count)++;
        return node;
    }
 
    if (key < node->key)
        node->left  = insert(node->left, key);
    else
        node->right = insert(node->right, key);
 
    return node;
}

Now Based upon Above code You can try to write code for “Search a value in BST with Duplicate” and Delete a node in BST with duplicate”.
PS : In delete a node in BST, Handling of adjusment of tree branches should happen.

Solution 2 :

If change in Structure of Binary Search Tree is not allowed, We can think of Extra memory like Hashmap to keep the count of nodes of BST to support duplicates in Binary Search Tree. ie Hashmap below is with above tree without count.

 3 - 1
 6 - 1
 7 - 1
 8 - 3
10 - 1
12 - 2

Solution 3:

We can think of keeping same keys on left side (we could also choose right side) to support duplicates in Binary Search Tree. For example consider insertion of keys 3, 6, 7, 8, 8, 8, 10, 12, 12  in an empty Binary Search Tree

              8
          /       \
        8         12
      /           /     \
    8           10      12
  /
 6   
/  \
3  7

 

 

Similar Articles

Filed Under: Amazon Interview Question, Flipkart Interview Questions, Hacker Earth Questions, Interview Questions, Microsoft Interview Questions, problem Tagged With: Binary Search Tree, Binary Tree

Reader Interactions

Primary Sidebar

Join WeekEnd Online/Offline Batch from 4-April-2020 on How to Crack Coding Interview in Just 10 Weeks : Fees just 20,000 INR

Join WeekEnd Online/Offline Batch from 4-April-2020

WhatsApp us

Secondary Sidebar

Custom Search

  • How I cracked AMAZON
  • LeetCode
  • Adobe
  • Amazon
  • Facebook
  • Microsoft
  • Hacker Earth
  • CSE Interview

Top Rated Questions

HackeEarth Flipkart’s Drone

SAP Off Campus Hiring_ March 2015 Computer Skills

Daughter’s Age VeryGood Puzzle

LeetCode: Binary Tree Maximum Path Sum

Edit Distance ( Dynamic Programming )

DFS (Depth First Search)

Minimum insertions to form a palindrome

flattens 2 D linked list to a single sorted link list

Code Chef PRGIFT Solution

Print all nodes that are at distance k from a leaf node

Knight Tour Problem (Graph – Breadth First Search)

Stock Buy Sell to Maximize Profit

Given Set of words or A String find whether chain is possible from these words or not

Count Possible Decodings of a given Digit Sequence

Get Minimum element in O(1) from input numbers or Stack

Find the kth number with prime factors 3, 5 and 7

Convert number to words java

Find if a binary tree is height balanced ?

Level order traversal in Spiral form

Given a sorted array and a number x, find the pair in array whose sum is closest to x

Find the smallest window in a string containing all characters of another string

LeetCode: Container With Most Water

Walmart Labs Interview Experience

Connect n ropes with minimum cost

Longest Increasing Subsequence

Check if an array has duplicate numbers in O(n) time and O(1) space

K’th Largest Element in BST when modification to BST is not allowed

Reverse a Linked List in groups of given size

Print Power Set of a Set

Find if two rectangles overlap

Copyright © 2025 · Genesis Framework · WordPress · Log in