func insertIntoBST(node *TreeNode, val int64) *TreeNode {
if node == nil {
return &TreeNode{
val: val,
}
}
if val < node.Val {
node.Left = insertIntoBST(node.Left, val)
} else {
node.Right = insertIntoBST(node.Right, val)
}
return node
}
12-14
1572
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)
06-17
7356
![](https://csdnimg.cn/release/blogv2/dist/pc/img/readCountWhite.png)