🥈

Insert into a Binary Search Tree

Created

2022/01/12 05:47

문제 번호

701

카테고리

Tree

Binary Search Tree

Binary Tree

Insert into a Binary Search Tree - LeetCode

You are given the root node of a binary search tree (BST) and a value to insert into the tree. Return the root node of the BST after the insertion. It is guaranteed that the new value does not exist in the original BST.

https://leetcode.com/problems/insert-into-a-binary-search-tree/

Code

제출 날짜	시간	메모리
2022/01/12	28 ms	7.5 MB

// 701. Insert into a Binary Search Tree
//
// https://leetcode.com/problems/insert-into-a-binary-search-tree/

// Definition for a binary tree node.
// type TreeNode struct {
//     Val int
//     Left *TreeNode
//     Right *TreeNode
// }

// insertIntoBST function insert a new node with value val into the binary tree.
// Fixup way can be used, but inserting the node to the leaf have been used in this case.
// If there's no node on the tree, just return a new node.
// Else, the child of each node should be validated to insert a new node. This can be done by recursion and assignation.
// Anyway no rotation has been used, just return the root node is the answer after insertion.
func insertIntoBST(root *TreeNode, val int) *TreeNode {
	if root == nil {
		return &TreeNode{Val: val}
	}
	if root.Val > val {
		root.Left = insertIntoBST(root.Left, val)
	} else {
		root.Right = insertIntoBST(root.Right, val)
	}
	return root
}
Go
복사