algorithm/leetcode-master
1
0
Fork 0
mirror of https://github.com/youngyangyang04/leetcode-master.git synced 2025-07-07 15:45:40 +08:00
Code Issues Packages Projects Releases Wiki Activity

Update 0701.二叉搜索树中的插入操作.md

Browse Source 
添加代码高亮
This commit is contained in:
sss1h
2024-02-27 20:26:57 +08:00
committed by GitHub
parent a518db03dd
commit 6fdcc59aec
1 changed files with 4 additions and 4 deletions
Download Patch File Download Diff File Expand all files Collapse all files

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

@ -59,7 +59,7 @@
代码如下： 代码如下：
``` ```cpp
TreeNode* insertIntoBST(TreeNode* root, int val) TreeNode* insertIntoBST(TreeNode* root, int val)
``` ```
@ -69,7 +69,7 @@ TreeNode* insertIntoBST(TreeNode* root, int val)
代码如下： 代码如下：
``` ```cpp
if (root == NULL) { if (root == NULL) {
TreeNode* node = new TreeNode(val); TreeNode* node = new TreeNode(val);
return node; return node;
@ -88,7 +88,7 @@ if (root == NULL) {
代码如下： 代码如下：
``` ```cpp
if (root->val > val) root->left = insertIntoBST(root->left, val); if (root->val > val) root->left = insertIntoBST(root->left, val);
if (root->val < val) root->right = insertIntoBST(root->right, val); if (root->val < val) root->right = insertIntoBST(root->right, val);
return root; return root;
@ -120,7 +120,7 @@ public:
那么递归函数定义如下： 那么递归函数定义如下：
``` ```cpp
TreeNode* parent; // 记录遍历节点的父节点 TreeNode* parent; // 记录遍历节点的父节点
void traversal(TreeNode* cur, int val) void traversal(TreeNode* cur, int val)
``` ```