Priority Queue & Heap
- By
Wayne
Priority queue is a very useful data structure. It can provide the maximum or minimum value in constant time.
Browsing Category
Algorithm
7 posts
Priority Queue & Heap
- By
Priority queue is a very useful data structure. It can provide the maximum or minimum value in constant time.
Binary Search Tree
- By
Binary search tree (BST) is a binary tree. It provides some useful operations including search, insert, delete, minimum, maximum, successor and predecessor.
Monotonic Stack
- By
Monotonic stack is a stack in which the value of the elements inside must be increasing or decreasing.
Union Find
- By
Union Find data structure is also known as disjoint set data structure. It is a data structure which stores a collection of disjoint sets. It provides two operations, one for merging two sets and one for finding the set with a given element.
Depth First Search (DFS)
- By
Depth-first search (DFS) algorithm is a graph search algorithm. Starting from a given vertex, it first explores an adjacent vertex of that vertex. Next, it explores an adjacent vertex of this vertex. In this way, the exploration continues until a certain vertex has no adjacent vertices, it will return to the previous vertex, and explores the next adjacent vertex of the vertex. It will continue to explore like this until it finds a result, or explores all vertices.
Breadth First Search (BFS)
- By
Breadth-first search (BFS) algorithm is a graph search algorithm. Starting from a given vertex, it first explores all adjacent vertices of that vertex. Next, explores the adjacent vertices of these adjacent vertices in sequence. In this way, it explores level by level until the result is found, or all vertices are explored.
