Some of the Tree Programs added

Trees/height_of_tree.cpp

@@ -0,0 +1,50 @@
+// C++ program to find height of tree / Depth of tree
+#include <bits/stdc++.h>
+using namespace std;
+
+class node {
+public:
+int data;
+node* left;
+node* right;
+};
+int DepthOfTree(node* node)
+{
+if (node == NULL)
+return 0;
+else {
+int leftDepth = DepthOfTree(node->left);
+int rightDepth = DepthOfTree(node->right);
+
+/* use the larger one */
+if (leftDepth > rightDepth)
+return (leftDepth + 1);
+else
+return (rightDepth + 1);
+}
+}
+node* newNode(int k)
+{
+node* Node = new node();
+Node->data = k;
+Node->left = NULL;
+Node->right = NULL;
+
+return (Node);
+}
+int main()
+{
+node* root = newNode(1);
+
+root->left = newNode(2);
+root->right = newNode(3);
+root->right->left=newNode(10);
+root->right->right=newNode(20);
+root->left->left = newNode(4);
+root->left->right = newNode(5);
+root->left->right->left = newNode(6);
+
+
+cout << "Height of tree is " << DepthOfTree(root);
+return 0;
+}

Trees/inorder_binary_tree.cpp

@@ -0,0 +1,33 @@
+//Program to find Inorder Binary Tree
+#include<bits/stdc++.h>
+using namespace std;
+struct Node {
+int key;
+struct Node*left;
+struct Node*right;
+Node(int K)
+{
+key=K;
+left=right=NULL;
+}
+};
+void inorder(Node*root)
+{
+if(root!=NULL)
+{
+inorder(root->left);
+cout<<root->key<<" ";
+inorder(root->right);
+}
+}
+int main()
+{
+Node*root=new Node(10);
+root->left=new Node(20);
+root->right=new Node(30);
+root->right->left=new Node(40);
+root->right->right=new Node(50);
+inorder(root);
+}
+
+// Output Generated

Trees/postorder_binary_tree.cpp

@@ -0,0 +1,35 @@
+//Program to find Postorder Binary Tree
+#include<bits/stdc++.h>
+using namespace std;
+struct Node {
+int key;
+struct Node*left;
+struct Node*right;
+Node(int K)
+{
+key=K;
+left=right=NULL;
+}
+};
+void inorder(Node*root)
+{
+if(root!=NULL)
+{
+inorder(root->left);
+inorder(root->right);
+cout<<root->key<<" ";
+
+}
+}
+int main()
+{
+Node*root=new Node(10);
+root->left=new Node(20);
+root->right=new Node(30);
+root->right->left=new Node(40);
+root->right->right=new Node(50);
+inorder(root);
+}
+
+//Output Generated
+//20 40 50 30 10 

Trees/preoder_binary_tree.cpp

@@ -0,0 +1,35 @@
+//Program to find Preorder Binary Tree
+#include<bits/stdc++.h>
+using namespace std;
+struct Node {
+int key;
+struct Node*left;
+struct Node*right;
+Node(int K)
+{
+key=K;
+left=right=NULL;
+}
+};
+void inorder(Node*root)
+{
+if(root!=NULL)
+{
+cout<<root->key<<" ";
+inorder(root->left);
+inorder(root->right);
+
+}
+}
+int main()
+{
+Node*root=new Node(10);
+root->left=new Node(20);
+root->right=new Node(30);
+root->right->left=new Node(40);
+root->right->right=new Node(50);
+inorder(root);
+}
+
+//Output Generated:
+//10 20 30 40 50