描述
给定一棵二叉查找树和一个新的树节点,将节点插入到树中。
你需要保证该树仍然是一棵二叉查找树。
样例 1:
输入: tree = {}, node= 1
输出: {1}
样例解释:
在空树中插入一个点,应该插入为根节点。
样例 2:
输入: tree = {2,1,4,3}, node = 6
输出: {2,1,4,3,6}
样例解释:
如下:
2 2
/ \ / \
1 4 --> 1 4
/ / \
3 3 6
解答:
二叉查找树有个特点:即左子树上的节点值比根节点小,右子树上的节点值比根节点大。
方法一:使用递归
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/*
* @param root: The root of the binary search tree.
* @param node: insert this node into the binary search tree
* @return: The root of the new binary search tree.
*/
TreeNode * insertNode(TreeNode * root, TreeNode * node) {
// write your code here
if(root == NULL)
{
// 根节点若为空,直接将新插入节点作为根节点
root = node;
}
else
{
// 若节点值小于根节点,插入左子树或作为左孩子插入
if(node->val < root->val)
{
if(root->left == NULL)
{
root->left = node;
}
else
{
insertNode(root->left, node);
}
}
// 若节点值大于等于根节点,插入右子树或作为右孩子插入
else
{
if(root->right == NULL)
{
root->right = node;
}
else
{
insertNode(root->right, node);
}
}
}
return root;
}
};
方法二:不使用递归
/**
* Definition of TreeNode:
* class TreeNode {
* public:
* int val;
* TreeNode *left, *right;
* TreeNode(int val) {
* this->val = val;
* this->left = this->right = NULL;
* }
* }
*/
class Solution {
public:
/*
* @param root: The root of the binary search tree.
* @param node: insert this node into the binary search tree
* @return: The root of the new binary search tree.
*/
TreeNode * insertNode(TreeNode * root, TreeNode * node) {
// write your code here
if(root == NULL)
{
root = node;
return root;
}
TreeNode* tmp = root;
while(tmp)
{
//先比较根节点和插入节点的值
if(node->val < tmp->val)
{
//若左孩子为空,则直接作为左孩子节点插入
//否则在左子树继续做插入操作
if(tmp->left == NULL)
{
tmp->left = node;
break;
}
else
{
tmp = tmp->left;
}
}
else
{
//若右孩子为空,则直接作为右孩子节点插入
//否则在右子树继续做插入操作
if(tmp->right == NULL)
{
tmp->right = node;
break;
}
else
{
tmp = tmp->right;
}
}
}
return root;
}
};