0% found this document useful (0 votes)
5 views12 pages

Introduction to Data Structures Basics

data structure notes

Uploaded by

sumit sharma
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
0% found this document useful (0 votes)
5 views12 pages

Introduction to Data Structures Basics

data structure notes

Uploaded by

sumit sharma
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 Structures – Introduction

Data Structures are methods of organizing, storing, and managing data efficiently so that
operations like access, modification, and deletion can be performed effectively. They are
fundamental to computer science and software engineering.
Classification of Data Structures

Data structures are broadly classified into Primitive and Non-Primitive. Primitive data structures
include int, char, float, and boolean. Non-Primitive data structures include arrays, linked lists,
stacks, queues, trees, and graphs.
Arrays

An array is a collection of elements stored at contiguous memory locations. Each element can be
accessed using an index. Arrays are simple and fast but have a fixed size.
Linked Lists

A linked list is a linear data structure where elements are stored in nodes. Each node contains data
and a reference to the next node. Linked lists allow dynamic memory allocation.
Stacks

A stack follows the LIFO (Last In First Out) principle. Common operations are push, pop, and peek.
Stacks are used in function calls, recursion, and expression evaluation.
Queues

A queue follows the FIFO (First In First Out) principle. Common operations are enqueue and
dequeue. Queues are used in scheduling and buffering.
Circular Queue

In a circular queue, the last position is connected back to the first position to make efficient use of
memory.
Trees

A tree is a hierarchical data structure consisting of nodes connected by edges. The top node is
called the root. Trees are used to represent hierarchical data.
Binary Tree

A binary tree is a tree in which each node has at most two children. Types include full binary tree,
complete binary tree, and binary search tree.
Binary Search Tree

A BST maintains order such that left child < parent < right child. Searching, insertion, and deletion
operations are efficient.
Graphs

A graph consists of vertices and edges. Graphs can be directed or undirected. They are used in
networks, maps, and social connections.
Applications of Data Structures

Data structures are used in databases, operating systems, artificial intelligence, compilers, and web
applications.

You might also like