Morris Traversal div-bargali#141

 Morris Traversal div-bargali#141

Author: div-bargali

C++/Data-Structures/Tree/Morris_Traversal/MorrisTraversal_Inorder.cpp

@@ -0,0 +1,106 @@
+// C++ program for Morris Inorder traversal 
+//Inorder Traversal :left, root, right
+
+#include<iostream>
+#include <bits/stdc++.h> 
+using namespace std; 
+
+//A tree node has data, left and right pointers
+class node 
+{ 
+public: 
+int data; 
+node *left;
+ node *right; 
+}; 
+
+// Function to create a new tree node
+node* newNode(int data) 
+{ 
+node* newnode = new node(); 
+newnode->data = data; 
+newnode->left = NULL;
+ newnode->right = NULL; 
+return newnode; 
+} 
+
+// Function for recursive inorder traversal 
+void inorder(node* root) 
+{ 
+if(!root)
+ return ;
+
+ inorder(root->left);
+cout<<root->data<<" "; 
+inorder(root->right); 
+
+} 
+
+// Preorder traversal without using recursion and without using stack 
+void morrisTraversalInorder(node* root) 
+{
+ if (!root) 
+ return; 
+
+ node *cur ;
+ 
+ while (root != NULL) { 
+ 
+ // If left child is null, print the current node data and move to right child. 
+ if (root->left == NULL) { 
+ cout<<root->data<<" ";
+ root = root->right; 
+ } 
+ else { 
+ 
+ // Find the inorder predecessor 
+ cur = root->left; 
+ while (cur->right != NULL && cur->right != root) 
+ cur = cur->right; 
+ 
+ // Make cur as the right child of its inorder predecessor
+ if (cur->right == NULL) { 
+ cur->right = root; 
+ root = root->left; 
+ } 
+ 
+ // If the right child of inorder predecessor already points to this node make it null, print the value and move root
+ else { 
+ cur->right = NULL; 
+ cout<<root->data<<" " ;
+ root = root->right; 
+ } 
+ } 
+ } 
+
+} 
+
+
+//Driver program
+int main() 
+{ 
+node* root = NULL; 
+
+root = newNode(2); 
+root->left = newNode(4); 
+root->right = newNode(6); 
+
+root->left->left = newNode(8); 
+root->left->right = newNode(10); 
+
+root->right->left = newNode(12); 
+root->right->right = newNode(14); 
+
+root->left->left->left = newNode(16); 
+root->left->left->right = newNode(18); 
+
+ cout<<"Morris Traversal (Inorder) \n";
+morrisTraversalInorder(root); 
+ cout<<"\n\n";
+
+ cout<<"Recursive Inorder Rraversal \n";
+inorder(root); 
+
+return 0; 
+} 
+

C++/Data-Structures/Tree/Morris_Traversal/MorrisTraversal_Preorder.cpp

@@ -0,0 +1,104 @@
+// C++ program for Morris Preorder traversal 
+//Preorder Traversal : Root, left, right
+
+#include<iostream>
+#include <bits/stdc++.h> 
+using namespace std; 
+
+//A tree node has data, left and right pointers
+class node 
+{ 
+public: 
+int data; 
+node *left;
+ node *right; 
+}; 
+
+//function to create a new tree node
+node* newNode(int data) 
+{ 
+node* newnode = new node(); 
+newnode->data = data; 
+newnode->left = NULL;
+ newnode->right = NULL; 
+return newnode; 
+} 
+
+// Function for recursive preorder traversal 
+void preorder(node* root) 
+{ 
+if(!root)
+ return ;
+ 
+cout<<root->data<<" "; 
+preorder(root->left); 
+preorder(root->right); 
+
+} 
+
+// Preorder traversal without using recursion and without using stack 
+void morrisTraversalPreorder(node* root) 
+{ 
+ //while root is not NULL
+while (root) 
+{ 
+// If left child is null, print the current node data and move to right child. 
+if (root->left == NULL) 
+{ 
+cout<<root->data<<" "; 
+root = root->right; 
+} 
+else
+{ 
+// Find inorder predecessor 
+node* cur = root->left; 
+while (cur->right && cur->right != root) 
+cur = cur->right; 
+
+// If the right child of inorder predecessor already points to this node make it null and move root
+if (cur->right == root) 
+{ 
+cur->right = NULL; 
+root = root->right; 
+} 
+
+// If right child doesn't point to this node, then print this node and make right child point to this node 
+else
+{ 
+cout<<root->data<<" "; 
+cur->right = root; 
+root = root->left; 
+} 
+} 
+} 
+} 
+
+
+//Driver program
+int main() 
+{ 
+node* root = NULL; 
+
+root = newNode(2); 
+root->left = newNode(4); 
+root->right = newNode(6); 
+
+root->left->left = newNode(8); 
+root->left->right = newNode(10); 
+
+root->right->left = newNode(12); 
+root->right->right = newNode(14); 
+
+root->left->left->left = newNode(16); 
+root->left->left->right = newNode(18); 
+
+ cout<<"Morris Traversal (Preorder) \n";
+morrisTraversalPreorder(root); 
+ cout<<"\n\n";
+
+ cout<<"Recursive Preorder Rraversal \n";
+preorder(root); 
+
+return 0; 
+} 
+