Contents
- 1 Can binary search trees have duplicates?
- 2 How do you know if two binary trees have the same values?
- 3 Can tree have duplicate values?
- 4 What happens if you insert an item that is already present in the binary tree?
- 5 How to handle duplicates in binary search tree?
- 6 How to check if two trees have the same structure?
- 7 How to check if an element is in the 2nd tree?
Can binary search trees have duplicates?
In the book “Introduction to algorithms”, third edition, by Cormen, Leiserson, Rivest and Stein, a binary search tree (BST) is explicitly defined as allowing duplicates.
How do you know if two binary trees have the same values?
Below is the step by step algorithm to check if two BSTs are identical:
- If both trees are empty then return 1.
- Else If both trees are non -empty. Check data of the root nodes (tree1->data == tree2->data)
- Else return 0 (one is empty and other is not).
Can binary tree have same value?
If you mean a “binary search tree”, my answer is “no”, since a search tree does not have any advantage in allowing duplicates, since SEARCHING for ONE value in a BST can only result in ONE value, not in two or more.
Can tree have 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.
What happens if you insert an item that is already present in the binary tree?
Inserting into a binary search tree The null tree is replaced by a leaf. If the value to be inserted is already in the tree, nothing is done.
What happens if you insert an item that is already present in the tree?
The actual insertion takes place when a null tree is encountered. The null tree is replaced by a leaf. If the value to be inserted is already in the tree, nothing is done.
How to handle duplicates in binary search tree?
A Simple Solution is to allow same keys on right side (we could also choose left side). For example consider insertion of keys 12, 10, 20, 9, 11, 10, 12, 12 in an empty Binary Search Tree
How to check if two trees have the same structure?
The idea is to traverse both trees simultaneously following the same paths and keep checking if a node exists for both the trees or not. If both trees are empty then return 1. If the value returned in above two steps are true then return 1. Else return 0 (one is empty and other is not). Below is the implementation of above algorithm:
Can two BSTs have the same values but different structures?
Duplicate values are allowed. Yes, there can be various BSTs consisting of the same numbers. Let’s take the numbers 1, 2, 3. If the order you add them to the tree is 1, 2, 3 then the tree would have 1 as root, 2 as it’s right node and 3 as 2’s right node.
How to check if an element is in the 2nd tree?
If yes, then mark the element in the list as negative and check for further elements otherwise if no, then immediately terminate the traversal and print No. If all the elements of 2nd tree is present in the list and are marked negative then finally traverse the list to check if there are any non-negative elements left.