Alawn/Interview-Notebook
1
0
Fork 0
mirror of https://github.com/CyC2018/Interview-Notebook.git synced 2026-10-24 02:03:41 +00:00
Code Issues Releases Wiki Activity

Update Leetcode 题解 - 树.md

Browse Source 
Co-Authored-By: Claude Fable 5 <noreply@anthropic.com>
This commit is contained in:
CyC2018
2026-10-23 04:39:45 +08:00
co-authored by Claude Fable 5
parent af66bd701e
commit 359581e1a3
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files
notes/Leetcode 题解 - 树.md
+4 -4
View File
@@ -31,12 +31,12 @@
* [5. 二叉树的最近公共祖先](#5-二叉树的最近公共祖先)
* [6. 从有序数组中构造二叉查找树](#6-从有序数组中构造二叉查找树)
* [7. 根据有序链表构造平衡的二叉查找树](#7-根据有序链表构造平衡的二叉查找树)
* [8. 在二叉查找树中寻找两个节点，使它们的和为一个给定值](#8-在二叉查找树中寻找两个节点，使它们的和为一个给定值)
* [8. 在二叉查找树中寻找两个节点，使它们的和为一个给定值](#8-在二叉查找树中寻找两个节点使它们的和为一个给定值)
* [9. 在二叉查找树中查找两个节点之差的最小绝对值](#9-在二叉查找树中查找两个节点之差的最小绝对值)
* [10. 寻找二叉查找树中出现次数最多的值](#10-寻找二叉查找树中出现次数最多的值)
* [Trie](#trie)
* [1. 实现一个 Trie](#1-实现一个-trie)
* [2. 实现一个 Trie，用来求前缀和](#2-实现一个-trie，用来求前缀和)
* [2. 实现一个 Trie，用来求前缀和](#2-实现一个-trie用来求前缀和)
<!-- GFM-TOC -->
@@ -239,7 +239,7 @@ public int pathSum(TreeNode root, int sum) {
return ret;
}
private int pathSumStartWithRoot(TreeNode root, int sum) {
private int pathSumStartWithRoot(TreeNode root, long sum) {
if (root == null) return 0;
int ret = 0;
if (root.val == sum) ret++;
@@ -757,7 +757,7 @@ private int count(TreeNode node) {
### 3. 把二叉查找树每个节点的值都加上比它大的节点的值
Convert BST to Greater Tree (Easy)
538\. Convert BST to Greater Tree (Easy)
[Leetcode](https://leetcode.com/problems/convert-bst-to-greater-tree/description/) / [力扣](https://leetcode-cn.com/problems/convert-bst-to-greater-tree/description/)