Given the root nodes of the two binary search trees. The task is to print 1 if the two Binary Search Trees are identical else print 0. Two trees are identical if they are identical structurally and nodes have the same values.
In the above images, both Tree1 and Tree2 are identical.
To identify if two trees are identical, we need to traverse both trees simultaneously, and while traversing we need to compare data and children of the trees.
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)
- Check left subtrees recursively i.e., call sameTree(tree1->left_subtree, tree2->left_subtree)
- Check right subtrees recursively i.e., call sameTree(tree1->right_subtree, tree2->right_subtree)
- If the values returned in the above three steps are true then return 1.
- Else return 0 (one is empty and other is not).
Below is the implementation of the above approach:
Both BSTs are identical
- Total number of possible Binary Search Trees and Binary Trees with n keys
- Check for Identical BSTs without building the trees
- Count the Number of Binary Search Trees present in a Binary Tree
- Merge Two Balanced Binary Search Trees
- Self-Balancing-Binary-Search-Trees (Comparisons)
- Print Common Nodes in Two Binary Search Trees
- Total number of possible Binary Search Trees using Catalan Number
- Check if an array represents Inorder of Binary Search tree or not
- Check if given sorted sub-sequence exists in binary search tree
- Check if a given array can represent Preorder Traversal of Binary Search Tree
- Binary Search Tree | Set 1 (Search and Insertion)
- m-WAY Search Trees | Set-1 ( Searching )
- Binary Search Tree | Set 2 (Delete)
- Sum of all the levels in a Binary Search Tree
- Optimal Binary Search Tree | DP-24
If you like GeeksforGeeks and would like to contribute, you can also write an article using contribute.geeksforgeeks.org or mail your article to email@example.com. 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.