Insert Node in a Binary Search Tree

最新推荐文章于 2024-02-22 18:15:11 发布

原创最新推荐文章于 2024-02-22 18:15:11 发布 · 238 阅读

0 ·

CC 4.0 BY-SA版权

算法专栏收录该内容

131 篇文章

订阅专栏

本文介绍了一种在二叉搜索树中插入新节点的方法，确保树的特性得以保持。通过递归方式调整树结构，使得插入操作既高效又保持了二叉搜索树的有序性。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary search tree and a new tree node, insert the node into the tree. You should keep the tree still be a valid binary search tree.

Have you met this question in a real interview? Yes
Example
Given binary search tree as follow, after Insert node 6, the tree should be:

2 2
/ \ / \
1 4 –> 1 4
/ / \
3 3 6

/**
 * Definition of TreeNode:
 * public class TreeNode {
 *     public int val;
 *     public TreeNode left, right;
 *     public TreeNode(int val) {
 *         this.val = val;
 *         this.left = this.right = null;
 *     }
 * }
 */
public class Solution {
    /**
     * @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.
     */
    public TreeNode insertNode(TreeNode root, TreeNode node) {
        if (root == null) {
            return node;
        }
        if (root.val > node.val) {
            root.left = insertNode(root.left, node);
        } else {
            root.right = insertNode(root.right, node);
        }
        return root;
    }
}