2003. 每个子树内缺失的最小遗传值
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find
Hard | Array, Dynamic Programming, Tree, Depth-First Search, Union-Find
Medium | Array, Tree, Depth-First Search, Binary Tree
Medium | String, Tree, Depth-First Search, Binary Tree
Hard | Array, Depth-First Search, Graph Theory, Eulerian Circuit
Medium | Array, Math, Depth-First Search, Breadth-First Search, Graph Theory, Geometry
Hard | Array, Dynamic Programming, Depth-First Search, Graph Theory, Topological Sort
Medium | Depth-First Search, Breadth-First Search, Graph Theory, Topological Sort
Hard | Array, String, Tree, Depth-First Search, Graph Theory, Topological Sort
Medium | Tree, Depth-First Search, Binary Tree
Medium | Depth-First Search, Breadth-First Search, Union-Find, Graph Theory