Scribd
Upload
2 views

Data_Structure_Definitions_BCA

The document provides definitions of various data structures, including arrays, linked lists, stacks, queues, trees, binary trees, binary search trees, graphs, hashing, searching, and sorting. Each data structure is briefly described with its key characteristics and principles. The focus is on how these structures organize, manage, and store data efficiently.

Uploaded by

Paras Parsodkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
2 views

Data_Structure_Definitions_BCA

The document provides definitions of various data structures, including arrays, linked lists, stacks, queues, trees, binary trees, binary search trees, graphs, hashing, searching, and sorting. Each data structure is briefly described with its key characteristics and principles. The focus is on how these structures organize, manage, and store data efficiently.

Uploaded by

Paras Parsodkar
Copyright
© © All Rights Reserved
Available Formats
Download as PDF, TXT or read online on Scribd
You are on page 1/ 2

Data Structures - Definitions (BCA)

1. Data Structure

A data structure is a way of organizing, managing, and storing data so that it can be accessed and modified

efficiently.

2. Array

An array is a collection of elements stored in contiguous memory locations, where each element is accessed

using an index.

3. Linked List

A linked list is a linear data structure in which elements (nodes) are connected using pointers, where each

node contains data and a reference to the next node.

4. Stack

A stack is a linear data structure that follows the LIFO (Last In, First Out) principle, where insertion and

deletion happen at one end (top).

5. Queue

A queue is a linear data structure that follows the FIFO (First In, First Out) principle, where insertion happens

at the rear and deletion at the front.

6. Tree

A tree is a non-linear hierarchical data structure consisting of nodes, where one node is the root, and others

are its children forming a parent-child relationship.


Data Structures - Definitions (BCA)

7. Binary Tree

A binary tree is a tree data structure in which each node has at most two children, referred to as the left child

and the right child.

8. Binary Search Tree (BST)

A BST is a binary tree in which each node follows the property: left child < parent < right child.

9. Graph

A graph is a non-linear data structure consisting of vertices (nodes) and edges (connections), used to

represent networks.

10. Hashing

Hashing is a technique used to uniquely identify a specific object using a key, and store it in a hash table for

fast retrieval.

11. Searching

Searching is the process of finding a particular element or record from a data structure.

12. Sorting

Sorting is the process of arranging elements in a specific order (ascending or descending).

You might also like