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 | 力扣

• Tags: Tree, Depth First Search

1519. Number of Nodes in the Sub-Tree With the Same Label

• LeetCode | 力扣

• Tags: Hash Table, Tree, Depth First Search, Breadth First Search, Counting

2872. Maximum Number of K-Divisible Components

• LeetCode | 力扣

• Tags: Tree, Depth First Search

2477. Minimum Fuel Cost to Report to the Capital

• LeetCode | 力扣

• Tags: Tree, Depth First Search, Breadth First Search, Graph

2973. Find Number of Coins to Place in Tree Nodes

• LeetCode | 力扣

• Tags: Dynamic Programming, Tree, Depth First Search, Sorting, Heap Priority Queue

2440. Create Components With Same Value

• LeetCode | 力扣

• Tags: Array, Math, Tree, Depth First Search, Enumeration

1273. Delete Tree Nodes 👑

• LeetCode | 力扣

• Tags: Array, Tree, Depth First Search, Breadth First Search

3004. Maximum Subtree of the Same Color 👑

• LeetCode | 力扣

• Tags: Array, Dynamic Programming, Tree, Depth First Search