Skip to lab content

B.TECH CSE & ALLIED BRANCHES · I YEAR, II SEMESTER · AR25

Data structures, step by step.

Explained through 12 complete C implementations.

8 experiments12 programsC17 solutions
Understand the representation before the code

Trace what each pointer, index, stack or queue stores. Then follow the flowchart, read the program and run a sample. Array and linked ADT implementations are separate pages so you can compare them.

ADT describes behaviour and operations; it is not a synonym for a linked list. Tree input describes a binary tree directly, while the BST experiment imposes ordered keys. Graph examples use an adjacency matrix and explain its actual O(V²) cost.

12 exercises

EXPERIMENT 01

Singly linked list

Creation, insertion, deletion and traversal.

1 solution
01Singly linked listExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 02

Doubly linked list

Creation, insertion, deletion and forward traversal; reverse traversal is also demonstrated.

1 solution
02Doubly linked listExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 03

Circular linked list

Creation, insertion, deletion and traversal on a circular singly linked list.

1 solution
03Circular singly linked listExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 04

Stack operations

Arrays and an ADT interface implemented with linked nodes.

2 solutions
04AStack using an arrayExplanation · flowcharts · tested code · line-by-line guide · complexity04BStack using an ADT interfaceExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 05

Queue operations

A circular array and an ADT interface implemented with linked nodes.

2 solutions
05AQueue using an arrayExplanation · flowcharts · tested code · line-by-line guide · complexity05BQueue using an ADT interfaceExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 06

Tree traversals

Preorder, inorder and postorder: recursive and non-recursive.

2 solutions
06ATree traversals — recursiveExplanation · flowcharts · tested code · line-by-line guide · complexity06BTree traversals — non-recursiveExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 07

Binary search tree

Insertion, search, deletion and inorder traversal.

1 solution
07Binary search tree — insert, search and deleteExplanation · flowcharts · tested code · line-by-line guide · complexity

EXPERIMENT 08

Graph traversals

DFS and BFS on an undirected graph, including disconnected components.

2 solutions
08AGraph traversal — DFSExplanation · flowcharts · tested code · line-by-line guide · complexity08BGraph traversal — BFSExplanation · flowcharts · tested code · line-by-line guide · complexity
How to run the command-based examples

Each page includes a command table and exact sample input. Menu-driven structures accept operation numbers but do not print repeated menu prompts. Enter all sample lines into standard input; finish list, stack, queue and BST sessions with 0. Tree and graph programs use the stated single-input format.