Python program to check if two trees are identical without using recursion














































Python program to check if two trees are identical without using recursion



Description:
Two trees are identical if they have the same data and same arrangements of data.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 trees.

Example:
                                        It will return false as their data are not same. 

                                      It will return True as their data and structures both are same.




Program:

from queue import Queue class newNode: def __init__(self, data): self.data = data self.left = self.right = None # Iterative method to find height of Bianry Tree def areIdentical(root1, root2): # Return true if both trees are empty if (not root1 and not root2): return True # Return false if one is empty and # other is not if (not root1 or not root2): return False # Create an empty queues for simultaneous traversals q1 = Queue() q2 = Queue() # Enqueue Roots of trees in respective queues q1.put(root1) q2.put(root2) while (not q1.empty() and not q2.empty()): # Get front nodes and compare them n1 = q1.queue[0] n2 = q2.queue[0] if (n1.data != n2.data): return False # Remove front nodes from queues q1.get() q2.get() # Enqueue left children of both nodes if (n1.left and n2.left): q1.put(n1.left) q2.put(n2.left) elif (n1.left or n2.left): return False if (n1.right and n2.right): q1.put(n1.right) q2.put(n2.right) elif (n1.right or n2.right): return False return True # Driver Code if __name__ == '__main__': root1 = newNode(1) root1.left = newNode(2) root1.right = newNode(3) root1.left.left = newNode(4) root1.left.right = newNode(5) root2 = newNode(1) root2.left = newNode(2) root2.right = newNode(3) root2.left.left = newNode(4) root2.left.right = newNode(5) if areIdentical(root1, root2): print("Yes") else: print("No")



Output:
Yes
>>>


More Articles of Khushboo Singh:

Name Views Likes
Python program to insert an element in binary tree. 820 20
Tokenize text using NLTK in Python. 1198 12
Python Remove multiple elements from list while Iterating. 731 22
Python How to Check if an item exists in list ? 4267 14
Python How to remove multiple elements from list ? 736 26
Python program to check if two trees are mirror of each other without using recursion. 660 19
Python program to find maximum in Binary tree. 929 19
Python Check if all elements are same using Set 709 15
Python program to find diameter of a binary tree. 1081 20
Python program to print root to leaf paths without using recursion. 839 20
Python program to find root of the tree where children id sum for every node is given. 669 23
Introduction of Python NLTK library 1355 25
Categorizing and Tagging Sentences using NLTK in Python . 999 19
Python program to find height of a tree without using recursion. 662 16
Python program to find sum of all nodes of the given perfect binary tree. 655 19
Python program to find minimum in binary tree. 820 23
Python Check if element exist in list using list.count() function. 690 13
Python program to convert a given binary tree to doubly linked list. 882 20
Python program to find distance between two nodes of a binary tree. 1521 20
NLTK stop Words 1134 13
Python program to find largest binary search tree in a Binary Tree. 934 20
Python program to find inorder successor in binary search tree with recursion. 1201 18
Python program to convert a binary tree into doubly linked list in spiral fashion. 794 15
Python List check if element are same using all() 667 12
Python program to check if two trees are identical using recursion. 705 30
Python Find the occurrence count of an element in the tuple using count() 964 23
Python Convert two lists to a dictionary 722 19
Python program to construct a complete binary tree from given array. 1426 14
Python program to find diameter of binary tree in O(n). 870 17
Introduction to the AVL tree. 739 15
Python program to check if two trees are identical without using recursion 660 17
Python Convert a list of tuples to dictionary. 1076 24
Python program to convert a binary tree to a circular doubly link list. 644 21
Python Check if element exist in list based on own logic. 737 23
Python program to merge two binary trees by doing node sum using recursion 999 27
Python program to check whether a given binary tree is perfect or not. 674 17
Python Check if all elements are same using list.count(). 1083 28
Python program to find an element into binary tree 627 12
Python program to find lowest common ancestor in a binary tree 1209 24

Comments