85题 Insert Node in a Binary Search Tree(非递归)

最新推荐文章于 2025-12-15 22:32:00 发布

原创最新推荐文章于 2025-12-15 22:32:00 发布 · 122 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#算法 #二叉树 #java

算法专栏收录该内容

232 篇文章

订阅专栏

这篇博客介绍了一个在二叉搜索树中非递归插入节点的方法。通过迭代方式找到合适的位置，保持树的平衡和有效性。核心代码展示了如何找到父节点并根据节点值决定插入位置。

Insert Node in a Binary Search Tree(非递归)

Description
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.

/**
 * 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 static TreeNode insertNode(TreeNode root, TreeNode node) {
        // write your code here
     
        TreeNode father = null ;
        TreeNode curt = root ;
        while(curt != null){
            father = curt ;
            if (node.val < curt.val){
                curt = curt.left ;
            }else{
                curt = curt.right ;
            }
        }
        if(father == null){
            return node ;
        }
        if (node.val < father.val){
            father.left = node ;
        }else{
            father.right = node ;
        }
        return root ;
    }
}