Scribd
Upload
3 views1 page

Data Structure Notes C

The document provides an overview of fundamental data structures in C, including arrays, stacks, queues, linked lists, searching, and sorting. Each data structure is briefly defined with examples illustrating their usage. It serves as a guide for beginners to understand these concepts up to an exam level.

Uploaded by

ahmedraisa395
Copyright
© All Rights Reserved
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
3 views1 page

Data Structure Notes C

The document provides an overview of fundamental data structures in C, including arrays, stacks, queues, linked lists, searching, and sorting. Each data structure is briefly defined with examples illustrating their usage. It serves as a guide for beginners to understand these concepts up to an exam level.

Uploaded by

ahmedraisa395
Copyright
© All Rights Reserved
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

Data Structure Notes in C (Beginner to Exam Level)

1. Array
Array is a collection of elements of same data type stored in contiguous memory locations.

Example:
int arr[5] = {10,20,30,40,50};

2. Stack
Stack follows LIFO (Last In First Out). Operations: Push, Pop.

Example Push:
stack[++top] = value;

3. Queue
Queue follows FIFO (First In First Out). Operations: Enqueue, Dequeue.

Example Enqueue:
queue[++rear] = value;

4. Linked List
Linked List is a collection of nodes connected using pointers.

Example:
struct node { int data; struct node *next; };

5. Searching
Searching is used to find element.
Example: Linear Search, Binary Search

6. Sorting
Sorting is arranging elements.
Example: Bubble Sort, Selection Sort

You might also like