Upload files to "DS/C/Lab/Week10"

DS/C/Lab/Week10/recurtree.c

@@ -0,0 +1,99 @@
+#include <stdio.h>
+#include <stdlib.h>
+#include <stdbool.h>
+#define MAX 100
+
+typedef struct TNode *Tptr;
+typedef struct TNode
+{
+    int data;
+    Tptr leftchild;
+    Tptr rightchild;
+}TNode;
+
+Tptr root;
+
+int top = -1;
+Tptr stack[MAX];
+
+//Create nodes in the tree
+Tptr createNode(int val)
+{
+    Tptr temp =(Tptr)malloc(sizeof(TNode));
+    temp->data = val;
+    temp->leftchild = temp->rightchild = NULL;
+    return temp;
+}
+
+
+
+Tptr createRecursive(Tptr root,int value)
+{
+    if (root == NULL) {
+        return createNode(value);
+    }
+
+    if (value < root->data) {
+        root->leftchild = createRecursive(root->leftchild, value);
+    } else if (value > root->data) {
+        root->rightchild = createRecursive(root->rightchild, value);
+    }
+
+    return root;
+}
+
+// Function for postorder Traversal of tree.
+void printPostorder(Tptr root)
+{
+    if (root) {
+        printPostorder(root->leftchild);
+        printPostorder(root->rightchild);
+        printf("%d ",root->data);
+    }
+}
+
+// Function for preorder Traversal of tree.
+void printPreorder(Tptr root)
+{
+    if (root) {
+        printf("%d ",root->data);
+        printPreorder(root->leftchild);
+        printPreorder(root->rightchild);
+    }
+}
+
+// Function for inorder Traversal of tree.
+void printInorder(Tptr root)
+{
+    if (root) {
+        printInorder(root->leftchild);
+        printf("%d ",root->data);
+        printInorder(root->rightchild);
+    }
+}
+
+
+int main() {
+
+    // Insert nodes into the binary tree
+    root = createRecursive(root,6);
+    root = createRecursive(root,4);
+    root = createRecursive(root,83);
+    root = createRecursive(root,25);
+    root = createRecursive(root,42);
+
+    // Print the binary tree using different tree traversal methods
+    printf("Binary Tree (In-Order): ");
+    printInorder(root);
+    printf("\n");
+
+    printf("Binary Tree (Pre-Order): ");
+    printPreorder(root);
+    printf("\n");
+
+    printf("Binary Tree (Post-Order): ");
+    printPostorder(root);
+    printf("\n");
+
+    return 0;
+}