0% found this document useful (0 votes)

2 views

ds

The document contains multiple C programs that demonstrate various operations on binary trees and linked lists, including creating nodes, inserting at different positions (beginning, middle, end), deleting nodes (first, middle, last), and displaying the list. Each program is structured to prompt the user for input and perform the specified operations on the data structures. The code snippets utilize standard libraries and dynamic memory allocation for managing nodes.

Uploaded by

arpitchristian00

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

0% found this document useful (0 votes)

2 views

ds

Uploaded by

arpitchristian00

We take content rights seriously. If you suspect this is your content, claim it here.

Available Formats

Download as PDF, TXT or read online on Scribd

You are on page 1/ 17

1.#include<stdio.

#include<conio.h>

void main()

{ int l1,lc,rc;

char a[16]={' ','+','-','*','A','B','C','/',' ',' ',' ',' ',' ',' ','E','F'};

clrscr();

printf("enter location of parent node");

scanf("%d",&l1);

lc=2*l1;

rc=(2*l1)+1;

printf("\n location of parent node is: %d",l1);

printf("\n parent node of location:%c",a[l1]);

printf("\n left childnode at location2:%c",a[lc]);

printf("\n right child node at location3:%c",a[rc]);

getch(); }

2.#include<stdio.h>

#include<conio.h>

void main()

{ int l1,lc,rc;

char a[16]={' ','+','-','*','A','B','C','/',' ',' ',' ',' ',' ',' ','E','F'};

clrscr();

printf("enter location of child:");

scanf("%d",&lc);

l1=lc/2;

printf("\n location of left child node is: %d",lc);

printf("\n parent node at location:%c",a[l1]);

printf("\n left childnode at location:%c",a[lc]);

getch(); }

3.#include<stdio.h>

#include<stdlib.h>

struct node

{ int data;

struct node *next;

}*head;
void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion"); }

else

{ printf("enter data of node 1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;

temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break; }

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;

temp->next=newNode;

temp=temp->next;

} printf("SINGLE LINKED LIST CREATED\n");

} void insertatbegining(int data)

struct node *newNode;

newNode=(struct node*)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

}

else

{ newNode->data=data;

newNode->next=head;

head=newNode;

printf("Data Inserted");

void display()

{ struct node *temp;

if(head==NULL)

{ printf("List is empty");

else

{ temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

void main()

{ int n,data;

clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nenter data to insert at begining:");

scanf("%d",&data);

insertatbegining(data);

printf("\nData in list\n");

display();
getch();

4.#include<stdio.h>

#include<stdlib.h>

struct node

{ int data;

struct node *next;

}*head;

void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion");

else

{ printf("enter data of node 1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;

temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break;

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;
temp->next=newNode;

temp=temp->next;

} printf("SINGLE LINKED LIST CREATED\n");

void insertatmiddle(int data,int position)

{ int i;

struct node newNode,temp;

newNode=(struct node*)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

else

{ newNode->data=data;

newNode->next=NULL;

temp=head;

for(i=2;i<=position-1;i++)

{ temp=temp->next;

if(temp==NULL)

{ break;

if(temp!=NULL)

{ newNode->next=temp->next;

temp->next=newNode;

printf("Data Inserted");

else

{ printf("Unable to insert data ar given position");

}
}

void display()

{ struct node *temp;

if(head==NULL)

printf("List is empty");

else

{ temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

void main()

{ int n,data,position;

clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nenter data to insert at middle:");

scanf("%d",&data);

printf("\nenter position to insert new node:");

scanf("%d",&position);

insertatmiddle(data,position);

printf("\nData in list\n");

display();

getch();

5.#include<stdio.h>

#include<stdlib.h>
struct node

{ int data;

struct node *next;

}*head;

void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion");

else

{ printf("enter data of node 1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;

temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break;

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;

temp->next=newNode;

temp=temp->next;

} printf("SINGLE LINKED LIST CREATED\n");

}

void insertatend(int data)

{ struct node newNode,temp;

newNode=(struct node*)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

else

{ newNode->data=data;

newNode->next=NULL;

temp=head;

while(temp->next!=NULL)

{ temp=temp->next;

temp->next=newNode;

printf("Data Inserted");

void display()

struct node *temp;

if(head==NULL)

{ printf("List is empty");

else

{ temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

}
}

void main()

{ int n,data;

clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nenter data to insert at end:");

scanf("%d",&data);

insertatend(data);

printf("\nData in list\n");

display();

getch();

6.#include<stdio.h>

#include<stdlib.h>

struct node

{ int data;

struct node *next;

}*head;

void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion");

else

{ printf("enter data of node 1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;
temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break;

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;

temp->next=newNode;

temp=temp->next;

printf("SINGLE LINKED LIST CREATED\n");

void deletefirstnode()

{ struct node *todelete;

if(head==NULL)

{ printf("List is already empty");

else

{ todelete=head;

head=head->next;

printf("\nData deleted=%d\n",todelete->data);

free(todelete);

printf("First Node Deleted");

}
void display()

{ struct node *temp;

if(head==NULL)

{ printf("List is empty");

else

{ temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

void main()

{ int n,ch;

clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nPress 1 to delete first node:");

scanf("%d",&ch);

if(ch==1)

{ deletefirstnode();

printf("\nData in list\n");

display();

getch();

7.#include<stdio.h>

#include<stdlib.h>

struct node

{ int data;
struct node *next;

}*head;

void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion");

else

printf("enter data of node1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;

temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break;

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;

temp->next=newNode;

temp=temp->next;

printf("SINGLE LINKED LIST CREATED\n");

}
}

void deletemiddlenode(int position)

{ int i;

struct node todelete,prevnode;

if(head==NULL)

{ printf("List is already empty");

else

{ todelete=head;

prevnode=head;

for(i=2;i<=position;i++)

{ prevnode=todelete;

todelete=todelete->next;

if(todelete==NULL)

break;

if(todelete!=NULL)

{ if(todelete==head)

{ head=head->next;

prevnode->next=todelete->next;

todelete->next=NULL;

free(todelete);

printf(" Node Deleted from middle of list\n");

else

{ printf("Invalid position");

void display()
{ struct node *temp;

if(head==NULL)

{ printf("List is empty");

else

temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

void main()

{ int n,position;

clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nenter node position to delete:");

scanf("%d",&position);

deletemiddlenode(position);

printf("\nData in list\n");

display();

getch();

8.#include<stdio.h>

#include<stdlib.h>

struct node

{ int data;

struct node *next;

}*head;
void create(int n)

{ struct node newNode,temp;

int data,i;

head=(struct node*)malloc(sizeof(struct node));

if(head==NULL)

{ printf("memory underflow:No insertion");

else

{ printf("enter data of node 1:");

scanf("%d",&data);

head->data=data;

head->next=NULL;

temp=head;

for(i=2;i<=n;i++)

{ newNode=(struct node *)malloc(sizeof(struct node));

if(newNode==NULL)

{ printf("memory underflow:No insertion");

break;

else

{ printf("enter data of node %d:",i);

scanf("%d",&data);

newNode->data=data;

newNode->next=NULL;

temp->next=newNode;

temp=temp->next;

printf("SINGLE LINKED LIST CREATED\n");

void deletelastnode()

{ struct node todelete,secondlastnode;

if(head==NULL)

{ printf("List is already empty");

else

{ todelete=head;

secondlastnode=head;

while(todelete->next!=NULL)

{ secondlastnode=todelete;

todelete=todelete->next;

if(todelete==NULL)

{ head=NULL;

else

{ secondlastnode->next=NULL;

} free(todelete);

printf("Last Node Deleted");

void display()

{ struct node *temp;

if(head==NULL)

{ printf("List is empty");

else

{ temp=head;

while(temp!=NULL)

{ printf("Data=%d\n",temp->data);

temp=temp->next;

void main()

{ int n,ch;
clrscr();

printf("enter no. of nodes:");

scanf("%d",&n);

create(n);

printf("\nData in list\n");

display();

printf("\nPress 1 to delete last node:");

scanf("%d",&ch);

if(ch==1)

{ deletelastnode();

printf("\nData in list\n");

display();

getch();

Singly Linked Iist Programme As in "Understanding Pointers in C"-By Yashwant Kanetkar
No ratings yet
Singly Linked Iist Programme As in "Understanding Pointers in C"-By Yashwant Kanetkar
5 pages
Assignment 2
No ratings yet
Assignment 2
54 pages
Data Structures
No ratings yet
Data Structures
128 pages
DS program
No ratings yet
DS program
16 pages
Doublylink
No ratings yet
Doublylink
5 pages
Linked List Program
No ratings yet
Linked List Program
19 pages
Linked List Programs (Single, Double, Circular)
No ratings yet
Linked List Programs (Single, Double, Circular)
16 pages
CLL
No ratings yet
CLL
6 pages
SLL
No ratings yet
SLL
5 pages
Program - All Units
No ratings yet
Program - All Units
61 pages
Can we be strangers again
No ratings yet
Can we be strangers again
4 pages
It0501 Data Structures and Algorithms Lab Manual
No ratings yet
It0501 Data Structures and Algorithms Lab Manual
54 pages
DLL
No ratings yet
DLL
6 pages
Program 10
No ratings yet
Program 10
6 pages
DOUBLY LINKED LIST
No ratings yet
DOUBLY LINKED LIST
3 pages
Exercise 3
No ratings yet
Exercise 3
23 pages
DS Lab PGM
No ratings yet
DS Lab PGM
43 pages
Day16_Assignment
No ratings yet
Day16_Assignment
15 pages
Ds Lab Manual
No ratings yet
Ds Lab Manual
59 pages
Lab 2
No ratings yet
Lab 2
23 pages
ads circular queue
No ratings yet
ads circular queue
4 pages
Linked List Programs
No ratings yet
Linked List Programs
10 pages
Week 5
No ratings yet
Week 5
15 pages
Linked List
No ratings yet
Linked List
50 pages
Linked List Programs Assignment
No ratings yet
Linked List Programs Assignment
39 pages
Lab Manual Ex7 To Ex12
No ratings yet
Lab Manual Ex7 To Ex12
11 pages
25,26
No ratings yet
25,26
14 pages
DLL Codes
No ratings yet
DLL Codes
17 pages
Singly Linked List Program-Bhoomi Patel
No ratings yet
Singly Linked List Program-Bhoomi Patel
13 pages
Dsa CH 3 Program
No ratings yet
Dsa CH 3 Program
12 pages
Linked List
No ratings yet
Linked List
22 pages
Link List
No ratings yet
Link List
4 pages
Double LinkList Implement Steps by Step On 25-9
No ratings yet
Double LinkList Implement Steps by Step On 25-9
5 pages
Exp No: Date
No ratings yet
Exp No: Date
56 pages
Circular Double Linked List
No ratings yet
Circular Double Linked List
11 pages
Linked List
No ratings yet
Linked List
27 pages
Data Structure Unit 3 PPT
No ratings yet
Data Structure Unit 3 PPT
61 pages
Linked List DSA
No ratings yet
Linked List DSA
63 pages
EXP-4 & 5
No ratings yet
EXP-4 & 5
23 pages
ds exp6
No ratings yet
ds exp6
10 pages
Exp 6 - Dsa Lab File
No ratings yet
Exp 6 - Dsa Lab File
38 pages
19BCS2191 DAA Exp4
No ratings yet
19BCS2191 DAA Exp4
27 pages
202411005_ CS162_1
No ratings yet
202411005_ CS162_1
22 pages
Exercise 2
No ratings yet
Exercise 2
29 pages
Single Linked List
No ratings yet
Single Linked List
6 pages
Link List Program D
No ratings yet
Link List Program D
22 pages
Dsa Manual (2022) - 1-16
No ratings yet
Dsa Manual (2022) - 1-16
16 pages
Cse-Ds Lab Manual (Cs2208) - 1
No ratings yet
Cse-Ds Lab Manual (Cs2208) - 1
72 pages
Exp No: Date
No ratings yet
Exp No: Date
22 pages
Singly Linked List Operation
No ratings yet
Singly Linked List Operation
10 pages
New Microsoft Word Document
No ratings yet
New Microsoft Word Document
41 pages
ads double linked list
No ratings yet
ads double linked list
6 pages
8,9,10,11 ACC CODES
No ratings yet
8,9,10,11 ACC CODES
7 pages
Linked List
No ratings yet
Linked List
11 pages
Singly Linked List
No ratings yet
Singly Linked List
27 pages
LList
No ratings yet
LList
4 pages
Ds
No ratings yet
Ds
34 pages
Linked List Implementation in C
No ratings yet
Linked List Implementation in C
17 pages
Data Structure 1B, C
No ratings yet
Data Structure 1B, C
18 pages
Computer Engineering Laboratory Solution Primer
From Everand
Computer Engineering Laboratory Solution Primer
Karan Bhandari
No ratings yet
Definition of Stack: A Stack Is A in Which Insertions and Deletions Are Allowed Only Called The
No ratings yet
Definition of Stack: A Stack Is A in Which Insertions and Deletions Are Allowed Only Called The
38 pages
Addison - Wesley.problem - Solving.and - Program.design - In.c.advanced - topics.supplement.1993.SCAN DARKCROWN
No ratings yet
Addison - Wesley.problem - Solving.and - Program.design - In.c.advanced - topics.supplement.1993.SCAN DARKCROWN
196 pages
Record - Suggestive Format
No ratings yet
Record - Suggestive Format
41 pages
LeetCode Blind 75 by HackCode
No ratings yet
LeetCode Blind 75 by HackCode
48 pages
1649 Assignment1
No ratings yet
1649 Assignment1
18 pages
HCL SREE SASTHA
No ratings yet
HCL SREE SASTHA
61 pages
CSE 2122-DS Lesson Plan-17-8-2023
No ratings yet
CSE 2122-DS Lesson Plan-17-8-2023
9 pages
B - Tech - CSE Batch 2018 (07-05-2020)
No ratings yet
B - Tech - CSE Batch 2018 (07-05-2020)
55 pages
FinalExam-2010
No ratings yet
FinalExam-2010
19 pages
Front H
No ratings yet
Front H
5 pages
UG-comp-SY-24-25
No ratings yet
UG-comp-SY-24-25
93 pages
Stack: LIFO (Last in First Out)
No ratings yet
Stack: LIFO (Last in First Out)
13 pages
Data Structure and Algorithms - Two Mark Questions and Answers
No ratings yet
Data Structure and Algorithms - Two Mark Questions and Answers
6 pages
15csl38-Data Structures Lab Manual
No ratings yet
15csl38-Data Structures Lab Manual
48 pages
Ec2202 - Data Structures and Object Oriented Programming in C++ Model Question Paper Total Marks: 100 Part A - (10 X 2 20 Marks) Answer ALL Questions
No ratings yet
Ec2202 - Data Structures and Object Oriented Programming in C++ Model Question Paper Total Marks: 100 Part A - (10 X 2 20 Marks) Answer ALL Questions
6 pages
mcs21impquestion
No ratings yet
mcs21impquestion
45 pages
DATA-STRUCTURES Sample Questions To Prepare For VIVA
No ratings yet
DATA-STRUCTURES Sample Questions To Prepare For VIVA
27 pages
Lab-9 Abstract Data Types
No ratings yet
Lab-9 Abstract Data Types
10 pages
DSD Unit 2 Notes 12.06.23
No ratings yet
DSD Unit 2 Notes 12.06.23
51 pages
Data Structure (DS) Solved MCQ's With PDF Download (Set-6)
No ratings yet
Data Structure (DS) Solved MCQ's With PDF Download (Set-6)
6 pages
DSA Unit 1
No ratings yet
DSA Unit 1
28 pages
What Is Linear Data Structure
No ratings yet
What Is Linear Data Structure
2 pages
Mini Project in C Employee Record System
No ratings yet
Mini Project in C Employee Record System
18 pages
DSA Roadmap For STEP Internship - Placements
No ratings yet
DSA Roadmap For STEP Internship - Placements
5 pages
Exp No 5 Round Robin Using LL 221070068
No ratings yet
Exp No 5 Round Robin Using LL 221070068
7 pages
Technical Questions and Answers
No ratings yet
Technical Questions and Answers
183 pages
Threaded Binary Tree
No ratings yet
Threaded Binary Tree
25 pages
DS Lab 8 - Doubly Linked List and DECK
100% (1)
DS Lab 8 - Doubly Linked List and DECK
10 pages
DSA in Java
No ratings yet
DSA in Java
8 pages
Data Structure Viva Questions
85% (13)
Data Structure Viva Questions
11 pages

Note: This service is not intended for secure transactions such as banking, social media, email, or purchasing. Use at your own risk. We assume no liability whatsoever for broken pages.

ds

Uploaded by

ds

Uploaded by

1.#include<stdio.

char a[16]={' ','+','-','*','A','B','C','/',' ',' ',' ',' ',' ',' ','E','F'};

printf("enter location of parent node");

printf("\n location of parent node is: %d",l1);

printf("\n parent node of location:%c",a[l1]);

printf("\n left childnode at location2:%c",a[lc]);

printf("\n right child node at location3:%c",a[rc]);

char a[16]={' ','+','-','*','A','B','C','/',' ',' ',' ',' ',' ',' ','E','F'};

printf("enter location of child:");

printf("\n location of left child node is: %d",lc);

printf("\n parent node at location:%c",a[l1]);

printf("\n left childnode at location:%c",a[lc]);

struct node *next;

{ struct node *newNode,*temp;

head=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion"); }

{ printf("enter data of node 1:");

{ newNode=(struct node *)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node %d:",i);

} printf("SINGLE LINKED LIST CREATED\n");

} void insertatbegining(int data)

struct node *newNode;

newNode=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ struct node *temp;

printf("enter no. of nodes:");

printf("\nenter data to insert at begining:");

struct node *next;

{ struct node *newNode,*temp;

head=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node 1:");

{ newNode=(struct node *)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node %d:",i);

} printf("SINGLE LINKED LIST CREATED\n");

void insertatmiddle(int data,int position)

struct node *newNode,*temp;

newNode=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("Unable to insert data ar given position");

{ struct node *temp;

printf("enter no. of nodes:");

printf("\nenter data to insert at middle:");

printf("\nenter position to insert new node:");

struct node *next;

{ struct node *newNode,*temp;

head=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node 1:");

{ newNode=(struct node *)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node %d:",i);

} printf("SINGLE LINKED LIST CREATED\n");

void insertatend(int data)

{ struct node *newNode,*temp;

newNode=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

struct node *temp;

printf("enter no. of nodes:");

printf("\nenter data to insert at end:");

struct node *next;

{ struct node *newNode,*temp;

head=(struct node*)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node 1:");

{ newNode=(struct node *)malloc(sizeof(struct node));

{ printf("memory underflow:No insertion");

{ printf("enter data of node %d:",i);

printf("SINGLE LINKED LIST CREATED\n");

{ struct node *todelete;

{ printf("List is already empty");

printf("First Node Deleted");

{ struct node *temp;

printf("enter no. of nodes:");

{ struct node newNode,temp;

{ struct node newNode,temp;

struct node newNode,temp;

{ struct node newNode,temp;

{ struct node newNode,temp;

{ struct node newNode,temp;

{ struct node newNode,temp;

struct node todelete,prevnode;

{ struct node newNode,temp;

{ struct node todelete,secondlastnode;