CS_learn/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2026-02-02 18:39:09 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update

Browse Source
This commit is contained in:
youngyangyang04
2020-09-30 15:13:51 +08:00
parent c0be90a277
commit 865f054d4a
9 changed files with 134 additions and 41 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
problems/0701.二叉搜索树中的插入操作.md
View File

@@ -11,7 +11,7 @@ https://leetcode-cn.com/problems/insert-into-a-binary-search-tree/
例如插入元素10 ，需要找到末尾节点插入便可，一样的道理来插入元素15，插入元素0，插入元素6，**需要调整二叉树的结构么？ 并不需要。**只需要遍历二叉搜索树，找到空节点 插入元素就可以了， 那么这道题其实就非常简单了。
<video src='../video/701.二叉搜索树中的插入操作.mp4' controls='controls' width='640' height='320' autoplay='autoplay'> Your browser does not support the video tag.</video></div>
<img src='../video/701.二叉搜索树中的插入操作.gif' width=600> </img></div>
接下来就是遍历二叉搜索树的过程了。