General Tree Others

Table of Contents

• 2003. Smallest Missing Genetic Value in Each Subtree (Hard)
• 2867. Count Valid Paths in a Tree (Hard)
• 2421. Number of Good Paths (Hard)
• 1719. Number Of Ways To Reconstruct A Tree (Hard)
• 2479. Maximum XOR of Two Non-Overlapping Subtrees (Hard) 👑

2003. Smallest Missing Genetic Value in Each Subtree

• LeetCode | 力扣

• Tags: Dynamic Programming, Tree, Depth First Search, Union Find

2867. Count Valid Paths in a Tree

• LeetCode | 力扣

• Tags: Math, Dynamic Programming, Tree, Depth First Search, Number Theory

2421. Number of Good Paths

• LeetCode | 力扣

• Tags: Array, Hash Table, Tree, Union Find, Graph, Sorting

1719. Number Of Ways To Reconstruct A Tree

• LeetCode | 力扣

• Tags: Tree, Graph

2479. Maximum XOR of Two Non-Overlapping Subtrees

• LeetCode | 力扣

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

Comments