Breadth-First Search

2458. 移除子树后的二叉树高度

Hard | Array, Tree, Depth-First Search, Breadth-First Search, Binary Tree

Medium | Array, Tree, Depth-First Search, Breadth-First Search, Graph Theory

Medium | Tree, Breadth-First Search, Binary Tree

Medium | Tree, Depth-First Search, Breadth-First Search, Graph Theory

Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory

Hard | Array, Two Pointers, Breadth-First Search, Union-Find, Sorting, Heap (Priority Queue), Matrix

Medium | Array, Dynamic Programming, Depth-First Search, Breadth-First Search, Matrix

Hard | Array, Breadth-First Search, Graph Theory, Heap (Priority Queue), Matrix, Shortest Path

Medium | Tree, Breadth-First Search, Sorting, Binary Tree

Medium | Array, Depth-First Search, Breadth-First Search, Matrix, Simulation

Hard | Breadth-First Search, Graph Theory

Hard | Array, Hash Table, Breadth-First Search, Union-Find, Ordered Set

Hard | Array, Dynamic Programming, Stack, Breadth-First Search, Union-Find, Heap (Priority Queue), Matrix, Monotonic Stack

Hard | Array, Hash Table, Bit Manipulation, Breadth-First Search, Matrix

Hard | Array, Breadth-First Search, Matrix

Hard | Array, Breadth-First Search, Graph Theory

Medium | Tree, Depth-First Search, Breadth-First Search, Binary Tree

Medium | Array, Depth-First Search, Breadth-First Search

Medium | Array, Hash Table, Breadth-First Search, Graph Theory, Sorting