#data-structures
Read more stories on Hashnode
Articles with this tag
Hashing is a technique used to map data (such as strings, numbers, or any other data type) to a fixed-size value, often called a hash code or hash...
Searching is the process of finding a particular element in a collection of items, such as an array, list, or database. The goal of searching is to...
In sorting algorithms, the primary goal is to arrange elements in a certain order, usually numerical or lexicographical. Sorting is a fundamental...
A graph is a collection of nodes (also called vertices) and edges that connect pairs of nodes. Graphs are an abstract data structure used to represent...
In computer science, trees are a fundamental non-linear data structure composed of nodes connected by edges. A tree is a hierarchical model that...
Queues are a fundamental data structure in computer science, widely used in various algorithms and applications. Understanding the queue's basic...
