Skip to content

Navigation Menu

Sign in
Appearance settings

Search code, repositories, users, issues, pull requests...

Provide feedback

We read every piece of feedback, and take your input very seriously.

Saved searches

Use saved searches to filter your results more quickly

Sign up
Appearance settings

Commit 44cb5a3

Browse files
committed
fix: update lcof solution: No.68 - I
1 parent 1b9abdc commit 44cb5a3

File tree

2 files changed

+1
-1
lines changed

2 files changed

+1
-1
lines changed

‎lcof/面试题68 - I. 二叉搜索树的最近公共祖先/README.md‎

Lines changed: 1 addition & 1 deletion
Original file line numberDiff line numberDiff line change
@@ -8,7 +8,7 @@
88

99
例如,给定如下二叉搜索树: root = `[6,2,8,0,4,7,9,null,null,3,5]`
1010

11-
![](https://assets.leetcode-cn.com/aliyun-lc-upload/uploads/2018/12/14/binarysearchtree_improved.png)
11+
![](./images/binarysearchtree_improved.png)
1212

1313
**示例 1:**
1414

7.48 KB
Loading[フレーム]

0 commit comments

Comments
(0)

AltStyle によって変換されたページ (->オリジナル) /