Breadth-First Search

530. 二叉搜索树的最小绝对差

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

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

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

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

Easy | Hash Table, Two Pointers, Tree, Depth-First Search, Breadth-First Search, Binary Search Tree, Binary Tree

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

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

Medium | Math, Bit Manipulation, Depth-First Search, Breadth-First Search

Hard | Array, Breadth-First Search, Heap (Priority Queue), Matrix

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