| 00094 |
Binary Tree Inorder Traversal |
二叉树的中序遍历 |
| 00098 |
Validate Binary Search Tree |
验证二叉搜索树 |
| 00100 |
Same Tree |
相同的树 |
| 00101 |
Symmetric Tree |
对称二叉树 |
| 00102 |
Binary Tree Level Order Traversal |
二叉树的层次遍历 |
| 00103 |
Binary Tree Zigzag Level Order Traversal |
二叉树的锯齿形层次遍历 |
| 00104 |
Maximum Depth of Binary Tree |
二叉树的最大深度 |
| 00105 |
Construct Binary Tree from Preorder and Inorder Traversal |
从前序与中序遍历序列构造二叉树 |
| 00106 |
Construct Binary Tree from Inorder and Postorder Traversal |
从中序与后序遍历序列构造二叉树 |
| 00107 |
Binary Tree Level Order Traversal II |
二叉树的层次遍历 II |
| 00108 |
Convert Sorted Array to Binary Search Tree |
将有序数组转换为二叉搜索树 |
| 00109 |
Convert Sorted List to Binary Search Tree |
有序链表转换二叉搜索树 |
| 00110 |
Balanced Binary Tree |
平衡二叉树 |
| 00111 |
Minimum Depth of Binary Tree |
二叉树的最小深度 |
| 00112 |
Path Sum |
路径总和 |
| 00113 |
Path Sum II |
路径总和 II |
| 00114 |
Flatten Binary Tree to Linked List |
二叉树展开为链表 |
| 00116 |
Populating Next Right Pointers in Each Node |
填充每个节点的下一个右侧节点指针 |
| 00117 |
Populating Next Right Pointers in Each Node II |
填充每个节点的下一个右侧节点指针 II |
| 00124 |
Binary Tree Maximum Path Sum |
二叉树中的最大路径和 |
| 00129 |
Sum Root to Leaf Numbers |
求根到叶子节点数字之和 |
| 00144 |
Binary Tree Preorder Traversal |
二叉树的前序遍历 |
| 00145 |
Binary Tree Postorder Traversal |
二叉树的后序遍历 |
| 00173 |
Binary Search Tree Iterator |
二叉搜索树迭代器 |
| 00199 |
Binary Tree Right Side View |
二叉树的右视图 |
| 00222 |
Count Complete Tree Nodes |
完全二叉树的节点个数 |
| 00226 |
Invert Binary Tree |
翻转二叉树 |
| 00230 |
Kth Smallest Element in a BST |
二叉搜索树中第K小的元素 |
| 00235 |
Lowest Common Ancestor of a Binary Search Tree |
二叉搜索树的最近公共祖先 |
| 00236 |
Lowest Common Ancestor of a Binary Tree |
二叉树的最近公共祖先 |
| 00297 |
Serialize and Deserialize Binary Tree |
二叉树的序列化与反序列化 |
| 00331 |
Verify Preorder Serialization of a Binary Tree |
验证二叉树的前序序列化 |
| 00337 |
House Robber III |
打家劫舍 III |
| 00404 |
Sum of Left Leaves |
左叶子之和 |
| 00429 |
N-ary Tree Level Order Traversal |
N叉树的层序遍历 |
| 00437 |
Path Sum III |
路径总和 III |
| 00449 |
Serialize and Deserialize BST |
序列化和反序列化二叉搜索树 |
| 00450 |
Delete Node in a BST |
删除二叉搜索树中的节点 |
| 00508 |
Most Frequent Subtree Sum |
出现次数最多的子树元素和 |
| 00513 |
Find Bottom Left Tree Value |
找树左下角的值 |
| 00515 |
Find Largest Value in Each Tree Row |
在每个树行中找最大值 |
| 00530 |
Minimum Absolute Difference in BST |
二叉搜索树的最小绝对差 |
| 00538 |
Convert BST to Greater Tree |
把二叉搜索树转换为累加树 |
| 00543 |
Diameter of Binary Tree |
二叉树的直径 |
| 00559 |
Maximum Depth of N-ary Tree |
N叉树的最大深度 |
| 00563 |
Binary Tree Tilt |
二叉树的坡度 |
| 00572 |
Subtree of Another Tree |
另一个树的子树 |
| 00589 |
N-ary Tree Preorder Traversal |
N叉树的前序遍历 |
| 00590 |
N-ary Tree Postorder Traversal |
N叉树的后序遍历 |
| 00606 |
Construct String from Binary Tree |
根据二叉树创建字符串 |
| 00617 |
Merge Two Binary Trees |
合并二叉树 |
| 00637 |
Average of Levels in Binary Tree |
二叉树的层平均值 |
| 00652 |
Find Duplicate Subtrees |
寻找重复的子树 |
| 00653 |
Two Sum IV - Input is a BST |
两数之和 IV - 输入 BST |
| 00654 |
Maximum Binary Tree |
最大二叉树 |
| 00669 |
Trim a Binary Search Tree |
修剪二叉搜索树 |
| 00687 |
Longest Univalue Path |
最长同值路径 |
| 00700 |
Search in a Binary Search Tree |
二叉搜索树中的搜索 |
| 00701 |
Insert into a Binary Search Tree |
二叉搜索树中的插入操作 |
| 00783 |
Minimum Distance Between BST Nodes |
二叉搜索树结点的最小距离 |
| 00814 |
Binary Tree Pruning |
二叉树剪枝 |
| 00872 |
Leaf-Similar Trees |
叶子相似的树 |
| 00897 |
Increasing Order Search Tree |
递增顺序查找树 |
| 00938 |
Range Sum of BST |
二叉搜索树的范围和 |
| 00958 |
Check Completeness of a Binary Tree |
二叉树的完全性检验 |
| 00965 |
Univalued Binary Tree |
单值二叉树 |
| 00987 |
Vertical Order Traversal of a Binary Tree |
二叉树的垂序遍历 |
| 01022 |
Sum of Root To Leaf Binary Numbers |
从根到叶的二进制数之和 |
| 01026 |
Maximum Difference Between Node and Ancestor |
节点与其祖先之间的最大差值 |
| 01080 |
Insufficient Nodes in Root to Leaf Paths |
根到叶路径上的不足节点 |
| 01104 |
Path In Zigzag Labelled Binary Tree |
二叉树寻路 |
| 01110 |
Delete Nodes And Return Forest |
删点成林 |
| 01123 |
Lowest Common Ancestor of Deepest Leaves |
最深叶节点的最近公共祖先 |