701. Insert into a Binary Search Tree.py

# Definition for a binary tree node.
# class TreeNode:
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right
class Solution:
    def insertIntoBST(self, root: TreeNode, val: int) -> TreeNode:
        if not root:
            return TreeNode(val)
        else:
            if val>root.val:
                root.right=self.insertIntoBST(root.right,val)
            else:
                root.left=self.insertIntoBST(root.left,val)
        
        return root