Tree Traversal

CPP/Data Structures/Trees/Binary Trees/TreeTraversal.cpp

@@ -0,0 +1,76 @@
+//TREE TRAVERSAL
+#include<iostream>
+#include<algorithm>
+using namespace std;
+struct node{
+ int data;
+ node* left;
+ node* right;
+};
+
+node* newNode(int key)
+{
+ node* tmp = new node();
+ tmp->data = key;
+ tmp->left = tmp->right = nullptr;
+
+ return tmp;
+}
+
+//INSERTION 
+node* insert(node* root, int l_data){
+ if(root == nullptr){
+ return newNode(l_data);
+ }
+ if(l_data <= root->data){
+ root->left = insert(root->left, l_data);
+ }else{
+ root->right = insert(root->right, l_data);
+ }
+ return root;
+}
+
+//INORDER TRAVERSAL
+void inorder(node* root){
+ if(root == nullptr){
+ return;
+ }
+ inorder(root->left);
+ cout<<root->data<<" ";
+ inorder(root->right);
+}
+
+//PREORDER TRAVERSAL
+void preOrder(node* root){
+ if(root == nullptr){
+ return;
+ }
+ cout<<root->data<<" ";
+ preOrder(root->left);
+ preOrder(root->right);
+}
+
+//POSTORDER TRAVERSAL
+void postOrder(node* root){
+ if(root == nullptr){
+ return;
+ }
+ postOrder(root->left);
+ postOrder(root->right);
+ cout<<root->data<<" ";
+}
+
+int main(){
+ node *root = newNode(1);
+
+ root->left = newNode(2);
+ root->right = newNode(3);
+ root->left->left = newNode(4);
+ root->left->right = newNode(5);
+ cout<<"\n Pre order transversal: ";
+ preOrder(root);
+ cout<<"\n Inorder transversal: ";
+ inorder(root);
+ cout<<"\n Post order transversal: ";
+ postOrder(root);
+}