mhatre.ganesh20

Data Structures Practical 27 Question 1 Write a C program to construct the binary search tree from following data. Elements: [1, 5, 7, 8, 10, 12] and traverse in pre-order. preorder.c C #include <stdio.h> #include <conio.h> #include <stdlib.h> struct node { int data; struct node *left; struct node *right; }; struct node* createNode(int value) {

Data Structures Practical 26 Question 1 Write a C program to create Binary Search Tree and display it. bst.c C #include <stdio.h> #include <conio.h> #include <stdlib.h> struct node { int data; struct node *left; struct node *right; }; struct node* createNode(int value) { struct node *newNode = (struct node *)malloc(sizeof(struct node)); newNode->data = value; newNode->left

Data Structures Practical 25 Question 1 Write a C program to implement enqueue operation on Priority queue using Linked List. priorityenqueue.c C #include <stdio.h> #include <stdlib.h> #include <conio.h> struct Node { int data; int priority; struct Node* next; }; struct Node* front = NULL; void enqueue(int, int); void display(); void main() { clrscr(); printf("— Priority

Data Structures Practical 24 Question 1 Write a C program to implement enqueue operation on Circular queue using Linked List. enqueue.c C #include <stdio.h> #include <stdlib.h> #include <conio.h> struct Node { int data; struct Node* next; }; struct Node* front = NULL; struct Node* rear = NULL; void enqueue(int); void display(); void main() { clrscr();

Data Structures Practical 23 Question 1 Write a C program to implement a Circular queue using Array with operations for enqueue (15), enqueue (48), enqueue (69), dequeue, enqueue (12), enqueue (23), dequeue, dequeue. circularq.c C #include <stdio.h> #include <stdlib.h> #include <conio.h> #define max 5 int queue[max]; int front = -1; int rear = -1; void

Data Structures Practical 22 Question 1 Write a C program to implement a linear queue using linked list with operations for enqueue (15), enqueue (48), enqueue (69), dequeue, enqueue (12), enqueue (23), dequeue, dequeue. queue.c C #include <stdio.h> #include <conio.h> #include <stdlib.h> struct Node { int data; struct Node* next; }; struct Node* front =

Data Structures Practical 21 Question 1 Write a C program to implement a linear queue with operations for enqueue (15), enqueue (48), enqueue (69), dequeue, enqueue (12), enqueue (23), dequeue, dequeue checking if the queue is empty or full, and displaying the current queue. queue.c C #include <stdio.h> #include <conio.h> #include <stdlib.h> #define max 7

Data Structures Practical 20 Question 1 Write a C program to traverse linked list using recursion traverse.c C #include <stdio.h> #include <stdlib.h> #include <conio.h> struct Node { int data; struct Node *next; }; struct Node *start = NULL; void traverseRecursive(struct Node *ptr); void insert(int data); void main() { int choice, data, targetData, val; char ch;

Data Structures Practical 19 Question 1 Write a C program to check whether a given string is a palindrome or not using recursion. strpalindrom.c C #include <stdio.h> #include <conio.h> #include <string.h> int isPalindromeRecursive(char str[], int start, int end); void main() { char str[50]; int len; clrscr(); printf("Enter a string: "); scanf("%s",str); len = strlen(str); if

Data Structures Practical 18 Question 1 Implement a C program to print Fibonacci series using recursion fibonacci.c C #include <stdio.h> #include <conio.h> int fibonacci(int n); void main() { int terms, i; clrscr(); printf("Enter the number of terms for Fibonacci series: "); scanf("%d", &terms); if (terms <= 0) { printf("nPlease enter a positive integer greater than