Graph traversal is a fundamental aspect of working with graph data structures, involving the process of visiting all vertices in a graph in a systematic manner. Two of the most widely used traversa...
Chang Wan
Cancel
Graph Traversal: Breadth-First Search and Depth-First Search
Graphs: Modelling Pairwise Relations
Graphs are a fundamental data structure in computer science and mathematics, used to model pairwise relations between objects. They are widely applicable in various fields such as network analysis,...
Red-Black Tree: The Most Popular Balancing Binary Search Tree
Ideally, the insertion, deletion, and search operations of a binary search tree have a time complexity of O(log n). However, a binary search tree may degenerate into a linked list during frequent d...
Binary Search Tree: Embodiment of Binary Search
Binary Search Trees (BSTs) are a fundamental data structure that allows for efficient search, insertion, and deletion operations. Central to the utility of BSTs is the binary search algorithm, whic...
Binary Trees: The Most Common Tree
Binary trees form the basis of many complex data structures and algorithms, including binary search trees, heaps, and balanced trees like AVL trees and red-black trees. Contents What is...
LRU Cache: Synergy of Hash Tables and Linked Lists
Hash tables and linked lists are two fundamental data structures commonly used in software development. While each has its distinct advantages, combining them often yields a data structure that lev...
How to Design a Hash Table
Designing a good hash table involves not just implementing the basic functionalities but also ensuring it meets the high standards of performance, reliability, and scalability required in productio...
Hash Tables: The Backbone of Efficient Data Searching
Hash tables are one of the most fundamental data structures in computer science, pivotal for enabling rapid data retrieval. Their efficiency and performance in accessing data make them indispensabl...
Skip Lists: Binary Search on Linked Lists
Skip lists are a fascinating and practical data structure that combines elements of both linked lists and balanced trees. Offering a clever probabilistic twist, skip lists provide efficient search,...
Binary Search: The Power of O(log n)
Binary search is a classic algorithm in computer science with time complexity O(log n), renowned for its efficiency in searching sorted arrays. Unlike linear search, which scans each element sequen...
