Tree

Hard | Dynamic Programming, Tree, Depth-First Search, Binary Search Tree, Binary Tree

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

Hard | Tree, Depth-First Search, Breadth-First Search, Graph Theory

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

Medium | Divide and Conquer, Greedy, Tree, Depth-First Search, Binary Search Tree, Binary Tree

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

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

Medium | Hash Table, Tree, Depth-First Search, Breadth-First Search, Counting

Medium | Tree, Depth-First Search, Binary Tree

Hard | Array, Math, Divide and Conquer, Dynamic Programming, Tree, Union-Find, Binary Search Tree, Memoization, Combinatorics, Binary Tree

Medium | Hash Table, Tree, Depth-First Search, Design

Medium | Tree, Breadth-First Search, Binary Tree

Hard | Dynamic Programming, Bit Manipulation, Tree, Enumeration, Bitmask

Hard | Array, Math, Tree, Depth-First Search, Number Theory

Hard | Array, Hash Table, Tree, Depth-First Search, Binary Search Tree, Binary Tree

Medium | Array, Hash Table, Tree, Depth-First Search, Breadth-First Search, Design

Medium | Array, Stack, Tree, Binary Search Tree, Monotonic Stack, Binary Tree

Easy | Tree, Depth-First Search, Binary Tree

Medium | Tree, Depth-First Search, Binary Tree

Hard | String, Tree, Depth-First Search, Binary Tree