Merge pull request #748 from JayRajM97/master

Added python and cpp code of Tree Sort

Author: matthewsamuel95

Sorting/TreeSort/C++/TreeSort.cpp

@@ -0,0 +1,65 @@
+#include <vector>
+#include <iostream>
+
+using namespace std;
+struct Node
+{
+    int data;
+    struct Node *left, *right;
+};
+struct Node *newnode(int key)
+{
+    struct Node *temp = new Node;
+    temp->data = key;
+    temp->left = NULL;
+    temp->right = NULL;
+    return temp;
+}
+
+Node* insert(Node *node, int key)
+{
+    if (node == NULL)
+        return newnode(key);               //If tree is empty return new node
+    if (key < node->data)
+        node->left = insert(node->left, key);
+    else
+        node->right = insert(node->right, key);
+    return node;
+}
+void store(Node *root, int a[], int &i)
+{
+    if (root != NULL)
+    {
+        store(root->left, a, i);
+        a[i++] = root->data;
+        store(root->right, a, i);
+    }
+}
+void TreeSort(vector<int>& a)
+{
+    struct Node *root = NULL;
+
+    //Construct binary search tree
+    root = insert(root, a[0]);
+    for (size_t i = 1; i < a.size(); i++)
+        insert(root, a[i]);
+
+    //Sorting the array using inorder traversal on BST
+    int i = 0;
+    store(root, a.data(), i);
+}
+
+int main()
+{
+
+    vector<int> a{1, 6, 8, 3, 10, 2, 12};
+
+    TreeSort(a);
+
+    cout << "The sorted array is :\n";
+    //Printing the sorted array
+    for (size_t i = 0; i < a.size(); i++)
+        cout << a[i] << " ";
+
+    return 0;
+}

Sorting/TreeSort/Python/TreeSort.py

@@ -0,0 +1,62 @@
+class Node:
+    """Base class to contain the tree metadata per instance of the class"""
+
+    def __init__(self, val):
+        self.l_child = None
+        self.r_child = None
+        self.data = val
+
+
+def binary_insert(root, node):
+    """This recursive function will insert the objects into the tree"""
+    if root is None:  # If we don't have a root node
+        root = node  # Set the root node equal to the first node argument that was provided
+    else:  # We already have a root
+        if root.data > node.data:  # If our current root is bigger than the node we are about to insert
+            if root.l_child is None:  # If we don't have any node to the left of root
+                root.l_child = node  # Insert the node as the left node under root
+            else:  # There's already a node to the left of root
+                binary_insert(
+                    root.l_child, node
+                )  # Call the insert function recursively with the left node value as the
+                # temp root for comparison
+        else:  # Node to be inserted is bigger than root (going right side)
+            if root.r_child is None:  # if there's no right child
+                root.r_child = node  # insert the node as the right child of root (under)
+            else:  #
+                binary_insert(
+                    root.r_child, node
+                )  # Call the insert function recursively with the right node value as the
+                # temp root for comparison
+
+
+def post_sort_print(root):
+    if not root:
+        return None
+    post_sort_print(root.l_child)
+    print(root.data)
+    post_sort_print(root.r_child)
+
+
+def pre_sort_print(root):
+    if not root:
+        return None
+    print(root.data)
+    pre_sort_print(root.l_child)
+    pre_sort_print(root.r_child)
+
+
+r = Node(6)
+binary_insert(r, Node(2))
+binary_insert(r, Node(8))
+binary_insert(r, Node(90))
+binary_insert(r, Node(23))
+binary_insert(r, Node(12))
+binary_insert(r, Node(91))
+
+print("---------")
+print("PRE SORT")
+pre_sort_print(r)
+print("---------")
+print("POST SORT")
+post_sort_print(r)