Merge pull request #471 from Shubh1006/tree

Tree

Author: geekquad

java/sorting/tree_sort.java

@@ -0,0 +1,89 @@
+// Java program to
+// implement Tree Sort
+class GFG
+{
+
+// Class containing left and
+// right child of current
+// node and key value
+class Node
+{
+int key;
+Node left, right;
+
+public Node(int item)
+{
+key = item;
+left = right = null;
+}
+}
+
+// Root of BST
+Node root;
+
+// Constructor
+GFG()
+{
+root = null;
+}
+
+// This method mainly
+// calls insertRec()
+void insert(int key)
+{
+root = insertRec(root, key);
+}
+
+/* A recursive function to
+insert a new key in BST */
+Node insertRec(Node root, int key)
+{
+
+/* If the tree is empty,
+return a new node */
+if (root == null)
+{
+root = new Node(key);
+return root;
+}
+
+/* Otherwise, recur
+down the tree */
+if (key < root.key)
+root.left = insertRec(root.left, key);
+else if (key > root.key)
+root.right = insertRec(root.right, key);
+
+/* return the root */
+return root;
+}
+
+// A function to do
+// inorder traversal of BST
+void inorderRec(Node root)
+{
+if (root != null)
+{
+inorderRec(root.left);
+System.out.print(root.key + " ");
+inorderRec(root.right);
+}
+}
+void treeins(int arr[])
+{
+for(int i = 0; i < arr.length; i++)
+{
+insert(arr[i]);
+}
+
+}
+
+// Driver Code
+public static void main(String[] args)
+{
+GFG tree = new GFG();
+int arr[] = {5, 4, 7, 2, 11};
+tree.treeins(arr);
+tree.inorderRec(tree.root);
+}
+}