This post is completed by 1 user Login To Mark Completed

0

Add to List Add To List..(Max 5) Close Save

Beginner

Check if Two BST's are Identical

Objective: Given Two binary Search Trees, Check if both are identical.

Input: Two binary Search Trees

Approach:

• Traverse both trees at the same time, starting from the root.
• Check if roots are not null and data are matched, if not, return false.
• Make recursive calls to root.left and root.right.
• If any of the trees gets over and other is not, return false.
• if both traversals of both trees end at the same time, return true
• see code.

Run This Code

Code:

true
false

---

---

Also Read:

- Swap Every Kth Node in a LinkedList Medium
- Towers Of Hanoi Beginner
- Inorder Successor in Binary Search Tree Using Parent link Hard
- Print All Paths from Top left to bottom right in Two Dimensional Array Medium
- Dynamic Programming - Minimum Coin Change Problem Medium
- Binary Min-Max Heap Implementation Hard
- Find the maximum width of a binary tree Medium
- Construct a binary tree from given Inorder and Postorder Traversal Hard

---