#datastructure
Read more stories on Hashnode
Articles with this tag
Introduction A Binary Search Tree (BST) is a data structure that maintains sorted data in a way that allows for efficient insertion, deletion, and...
Linear search is a simple searching algorithm used to find an element in a list or an array. It works by sequentially checking each element of the...
Introduction Quick sort follows the divide-and-conquer approach, selecting a pivot element and partitioning the array into two subarrays: elements...
Merge sort divides the array into two halves, recursively sorts each half, and then merges them back together in sorted order. It follows the...
Introduction Initialization: The function selectionSort accepts an array arr as its argument. The variable n stores the length of the...
Data Structures Stack Queue Singly Linked List Doubly Linked List Hash Table Heap Priority Queue Tree Binary Search Tree AVL Tree Red Black...
