Add files via upload

Author: jaydattpatel

ADT_Array_as_Queue_Circuler.c

@@ -0,0 +1,75 @@
+// author: jaydattpatel
+#include <stdio.h>
+#include <stdlib.h>
+#include <conio.h>
+
+#define n 5
+int cq[10],front =-1, rear = -1,item;
+
+void insert()
+{
+    if(front == ((rear+1)%(n-1)))
+    {   printf("Queue overflow !!\n");  return;  }
+    else
+    {
+        printf("\nEnter Value:");   scanf("%d",&item);
+        if(front == -1)     front = rear = 0 ;
+        else    rear = ((rear+1)%(n-1));
+        cq[rear] = item;
+        printf("Insertion Successfull !!\n");  
+        display();
+    }
+}
+
+void delete()
+{
+    if(front == -1)     printf("Queue underflow !!!\n");
+    else
+    {
+        item = cq[front];
+        printf("Elements deleted from queues.\n");
+        cq[front] = NULL;
+        if(front == rear)   front = rear = -1;
+        else    front = ((front+1)%(n-1));  
+        display();
+    }
+}
+void display()
+{
+    int i;
+    if(front == -1)     printf("Queue is emplty !!!\n");
+    else
+    {
+        if (front <= rear)
+        { for(i=front;i<=rear;i++)    printf("%d\n",cq[i]);}
+        
+        if (front > rear)
+        {
+            for(i=front;i<=n-1;i++)     printf("%d\n",cq[i]);
+            for(i=front;i<=rear;i++)    printf("%d\n",cq[i]);
+        }
+        printf("front queue is %d\n",cq[front]);
+        printf("rear queue is %d\n",cq[rear]);
+    }
+}
+
+int main()
+{
+    int value,choice;
+    while(1)
+    {
+            printf("\n--------queue implement Menu -------------");
+            printf("\n1.Insert\t2.Delete\t3.Display\t4.Exit");
+            printf("\nEnter your choice:");
+            scanf("%d",&choice);
+            switch(choice)
+            {
+                case 1:{insert();    break;}
+                case 2:{delete();    break;}
+                case 3:{display();   break;}
+                case 4:{exit(0);}
+                default:{printf("\nFunction Terminated.");   exit(0);}
+            }
+    } 
+    return(0);
+}

ADT_Array_as_Stack_infix_to_prefix_postfix.c

@@ -0,0 +1,54 @@
+// author: jaydattpatel
+#include<stdio.h>
+#include<ctype.h>
+
+char stack[100];
+int top = -1;
+
+void push(char x)
+    {stack[++top] = x;}
+
+char pop()
+{
+    if(top == -1)   return(-1);
+    else    return(stack[top--]);
+}
+
+int priority(char x)
+{
+    if(x == '(')    return 0;
+    if(x == '+' || x == '-')    return 1;
+    if(x == '*' || x == '/')    return 2;
+    return 0;
+}
+
+int main()
+{
+    char exp[100];
+    char *e, x;
+    printf("Enter the expression : ");
+    scanf("%s",exp);
+    printf("\n");
+    e = exp;
+    
+    while(*e != '\0')
+    {
+        if(isalnum(*e))     printf("%c ",*e);
+        else if(*e == '(')  push(*e);
+        else if(*e == ')')
+            {
+                while((x = pop()) != '(')   printf("%c ", x);
+            }
+        else
+        {
+            while(priority(stack[top]) >= priority(*e))
+                    printf("%c ",pop());
+            push(*e);
+        }
+        e++;
+    }
+    
+    while(top != -1)      printf("%c ",pop());
+    
+    return 0;
+}

ADT_Array_as_stack_push_pop.c

@@ -0,0 +1,61 @@
+// author: jaydattpatel
+#include <stdio.h>
+#include <stdlib.h>
+
+#define MAXSTK 10
+int stk[MAXSTK], top = -1;
+
+void push()
+    {
+        if(top >= (MAXSTK-1))
+        {printf("\nStack is Full !! Insertion not possible");}
+        else
+        {   int value;
+            printf("\nEnter Value:");   scanf("%d",&value);
+            top++;  stk[top] = value;   
+            printf("\nInsertion Successfull !!");
+        }
+    };
+void pop()
+    {   
+        if(top == -1)   
+        {printf("\nStack is Empty !! Deletion not possible");}
+        else
+        {
+            printf("\nDeleted : %d",stk[top]); 
+            stk[top] = 0;   top--;
+        }
+    };
+
+void display()
+    {
+        if(top == -1)   {printf("\nStack is Empty !!");}
+        else
+        {
+            int i;
+            printf("\nStack Elements are :\n ");
+            for(i=top;i>=0;i--)
+                printf("%d\n",stk[i]);      
+        }
+    };
+
+int main()
+{
+    int value,choice;
+    while(1)
+    {
+        printf("\n-----------Menu -------------");
+        printf("\n1.Push\t2.Pop\t3.Display\t4.Exit");
+        printf("\nEnter your choice:");
+        scanf("%d",&choice);
+        switch(choice)
+        {
+            case 1:{push();     break;}  
+            case 2:{pop();      break;}
+            case 3:{display();  break;}
+            case 4:{exit(0);}
+            default:{printf("\nFunction Terminated.");   exit(0);}
+            }
+    } 
+    return(0);
+}

ADT_Binary_Tree.c

@@ -0,0 +1,83 @@
+// Recursive C program for level order traversal of Binary Tree
+// author: jaydattpatel
+#include <stdio.h>
+#include <stdlib.h>
+
+/* A binary tree node has data,pointer to left child and a pointer to right child */
+struct node {
+	int data;
+	struct node *left, *right;
+};
+
+/* Function prototypes */
+void printCurrentLevel(struct node* root, int level);
+int height(struct node* node);
+struct node* newNode(int data);
+
+/* Function to print level order traversal a tree*/
+void printLevelOrder(struct node* root)
+{
+	int h = height(root);
+	int i;
+	for (i = 1; i <= h; i++)
+		printCurrentLevel(root, i);
+}
+
+/* Print nodes at a current level */
+void printCurrentLevel(struct node* root, int level)
+{
+	if (root == NULL)
+		return;
+	if (level == 1)
+		printf("%d ", root->data);
+	else if (level > 1) {
+		printCurrentLevel(root->left, level - 1);
+		printCurrentLevel(root->right, level - 1);
+	}
+}
+
+// Compute the "height" of a tree -- the number of nodes along the longest path from the root node down to the farthest leaf node.
+int height(struct node* node)
+{
+	if (node == NULL)
+		return 0;
+	else {
+		/* compute the height of each subtree */
+		int lheight = height(node->left);
+		int rheight = height(node->right);
+
+		/* use the larger one */
+		if (lheight > rheight)
+			return (lheight + 1);
+		else
+			return (rheight + 1);
+	}
+}
+
+// Helper function that allocates a new node with the given data and NULL left and right pointers. 
+struct node* newNode(int data)
+{
+	struct node* node
+		= (struct node*)malloc(sizeof(struct node));
+	node->data = data;
+	node->left = NULL;
+	node->right = NULL;
+
+	return (node);
+}
+
+int main()
+{
+	struct node* root = newNode(1);
+	root->left = newNode(2);
+	root->right = newNode(3);
+	root->left->left = newNode(4);
+	root->left->right = newNode(5);
+    root->right->left = newNode(6);
+	root->right->right = newNode(7);
+
+	printf("Level Order traversal of binary tree is \n");
+	printLevelOrder(root);
+
+	return 0;
+}

ADT_Binary_Tree_create.c

@@ -0,0 +1,53 @@
+/* The ADT Binary Tree 
+*/
+// author: jaydattpatel
+#include<stdio.h>
+#include<stdlib.h>
+
+struct node
+{
+    char data;
+    struct node *left;
+    struct node *right;
+};
+
+typedef struct node *BTREE; 
+//typedef NODE ;
+
+void inorder (BTREE root) 
+{
+    if (root != NULL) 
+    {
+        inorder(root ->left);
+        printf("%c\t", root ->data); 
+        inorder(root -> right);
+    }
+}
+
+
+BTREE init_node (char d1, BTREE p1, BTREE p2) 
+{
+    BTREE new_node;
+    new_node = (BTREE)(malloc(sizeof(struct node)));
+    new_node->data = d1;
+    new_node->left = p1;
+    new_node->right = p2;
+    return new_node;
+}
+BTREE create_tree(char data[], int i, int size) 
+{
+    if (i >= size) 
+        return NULL;
+    else
+        return(init_node( data[i], create_tree(data, 2*i + 1, size), create_tree(data, 2*i + 2, size) ));
+}
+
+int main()
+{
+    char data[] = {'A', 'B', 'C', 'D', 'E'};
+    BTREE b;
+    b = create_tree(data, 0, 5); 
+    inorder(b);
+    printf("\n\n");
+    return 0;
+}