diff --git a/src/algorithms/sorting/Tree-Sort/Treesort.js b/src/algorithms/sorting/Tree-Sort/Treesort.js
new file mode 100644
index 00000000..40c50629
--- /dev/null
+++ b/src/algorithms/sorting/Tree-Sort/Treesort.js
@@ -0,0 +1,69 @@
+// implementation of Tree Sort
+
+// Class containing left and
+// right child of current
+// node and key value
+class Node {
+
+constructor(item) {
+	this.key = item;
+	this.left = this.right = null;
+}
+}
+
+// Root of BST
+let root = new Node();
+
+root = null;
+
+// This method mainly
+// calls insertRec()
+function insert(key) {
+root = insertRec(root, key);
+}
+
+/* A recursive function to
+insert a new key in BST */
+function insertRec(root, 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
+function inorderRec(root) {
+if (root != null) {
+	inorderRec(root.left);
+	document.write(root.key + " ");
+	inorderRec(root.right);
+}
+}
+function treeins(arr) {
+for (let i = 0; i < arr.length; i++) {
+	insert(arr[i]);
+}
+
+}
+
+// Driver Code
+
+let arr = [5, 4, 7, 2, 11];
+treeins(arr);
+inorderRec(root);
+
+