General Tree Bottom-Up DFS¶
Table of Contents¶
- 3249. Count the Number of Good Nodes (Medium)
- 1519. Number of Nodes in the Sub-Tree With the Same Label (Medium)
- 2872. Maximum Number of K-Divisible Components (Hard)
- 2477. Minimum Fuel Cost to Report to the Capital (Medium)
- 2973. Find Number of Coins to Place in Tree Nodes (Hard)
- 2440. Create Components With Same Value (Hard)
- 1273. Delete Tree Nodes (Medium) 👑
- 3004. Maximum Subtree of the Same Color (Medium) 👑
3249. Count the Number of Good Nodes¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: tree, depth first search
1519. Number of Nodes in the Sub-Tree With the Same Label¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: hash table, tree, depth first search, breadth first search, counting
2872. Maximum Number of K-Divisible Components¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: tree, depth first search
2477. Minimum Fuel Cost to Report to the Capital¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: tree, depth first search, breadth first search, graph
2973. Find Number of Coins to Place in Tree Nodes¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: dynamic programming, tree, depth first search, sorting, heap priority queue
2440. Create Components With Same Value¶
-
LeetCode | LeetCode CH (Hard)
-
Tags: array, math, tree, depth first search, enumeration
1273. Delete Tree Nodes¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, tree, depth first search, breadth first search
3004. Maximum Subtree of the Same Color¶
-
LeetCode | LeetCode CH (Medium)
-
Tags: array, dynamic programming, tree, depth first search