Create bst.cpp

c++/bst.cpp

@@ -0,0 +1,43 @@
+//main function can be constructed as your wish
+void perorder(struct node*root)
+    {
+        if(root)
+        {
+            printf("%d ",root->data);    //Printf root->data
+            preorder(root->left);    //Go to left subtree
+            preorder(root->right);     //Go to right subtree
+        }
+    }
+void postorder(struct node*root)
+    {
+        if(root)
+        {
+            postorder(root->left);    //Go to left sub tree
+            postorder(root->right);     //Go to right sub tree
+            printf("%d ",root->data);    //Printf root->data
+        }
+    }
+void inorder(struct node*root)
+    {
+        if(root)
+        {
+            inorder(root->left);    //Go to left subtree
+            printf("%d ",root->data);    //Printf root->data
+            inorder(root->right);     //Go to right subtree
+        }
+    }
+struct node* insert(struct node* root, int data)
+    {
+        if (root == NULL)    //If the tree is empty, return a new,single node
+            return newNode(data);
+        else
+        {
+            //Otherwise, recur down the tree 
+            if (data <= root->data)
+                root->left  = insert(root->left, data);
+            else
+                root->right = insert(root->right, data);
+            //return the (unchanged) root pointer 
+            return root;
+        }
+    }

queue.cpp

@@ -0,0 +1,24 @@
+//use main function as you wish
+
+void enqueue(char queue[], char element, int& rear, int arraySize) {
+    if(rear == arraySize)            // Queue is full
+        printf("OverFlow\n");
+    else {
+        queue[rear] = element;    // Add the element to the back
+        rear++;
+    }
+}
+
+
+void dequeue(char queue[], int& front, int rear) {
+    if(front == rear)            // Queue is empty
+        printf("UnderFlow\n");
+    else {
+        queue[front] = 0;        // Delete the front element
+        front++;
+    }
+}
+
+char Front(char queue[], int front) {
+    return queue[front];
+}