Data Structures

Computers · डेटा संरचनाएं · 15 facts

Array stores elements of same type in contiguous memory

Stack follows LIFO (Last In First Out) principle

Queue follows FIFO (First In First Out) principle

Linked List stores data in nodes connected by pointers

Tree is hierarchical data structure with root node

Binary Tree has maximum two children per node

Graph represents connections between nodes (vertices)

Hash Table uses key-value pairs for fast data access

Sorting algorithms arrange data in order (Bubble, Quick, Merge)

Searching algorithms find specific data (Linear, Binary)

Deque (Double-ended Queue) allows insertion/deletion from both ends

Binary Search Tree (BST) enables fast search, insert and delete

Merge Sort has O(n log n) time complexity

Bubble Sort is simplest sorting algorithm with O(n²) complexity

Binary Search works only on sorted arrays with O(log n) complexity