Merge pull request BeeBombshell#114 from yashbhanu/main

Code for Morris Traversal in Binary Tree

Author: BeeBombshell

Tree Data Structure/morris_traversal.py

@@ -0,0 +1,42 @@
+
+class Node:
+	def __init__(self, data, left=None, right=None):
+		self.data = data
+		self.left = left
+		self.right = right
+
+
+def morris_traversal(root):
+
+	current = root
+
+	while current is not None:
+
+		if current.left is None:
+			yield current.data
+			current = current.right
+		else:
+
+			# Find the inorder
+			# predecessor of current
+			pre = current.left
+			while pre.right is not None and pre.right is not current:
+				pre = pre.right
+
+			if pre.right is None:
+
+				# Make current as right
+				# child of its inorder predecessor
+				pre.right = current
+				current = current.left
+
+			else:
+				# Revert the changes made
+				pre.right = None
+				yield current.data
+				current = current.right
+
+root = Node(1,right=Node(3),left=Node(2,left=Node(4),right=Node(5)))
+
+for v in morris_traversal(root):
+	print(v, end=' ')