110. 平衡二叉树
Easy | Tree, Depth-First Search, Binary Tree
Depth-First Search
111. 二叉树的最小深度
Easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree
112. 路径总和
Easy | Tree, Depth-First Search, Breadth-First Search, Binary Tree
113. 路径总和 II
Medium | Backtracking, Tree, Depth-First Search, Binary Tree
114. 二叉树展开为链表
Medium | Linked List, Stack, Tree, Depth-First Search, Binary Tree
116. 填充每个节点的下一个右侧节点指针
Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
117. 填充每个节点的下一个右侧节点指针 II
Medium | Linked List, Tree, Depth-First Search, Breadth-First Search, Binary Tree
124. 二叉树中的最大路径和
Hard | Dynamic Programming, Tree, Depth-First Search, Binary Tree
129. 求根节点到叶节点数字之和
Medium | Tree, Depth-First Search, Binary Tree
130. 被围绕的区域
Medium | Array, Depth-First Search, Breadth-First Search, Union-Find, Matrix