binary-search-tree-insertion-python
class TreeNode:↵
def __init__(self, key):↵
self.key = key↵
self.left = None↵
self.right = None↵
↵
def insert(root, key):↵
if root is None:↵
return TreeNode(key)↵
if key < root.key:↵
root.left = insert(root.left, key)↵
elif key > root.key:↵
root.right = insert(root.right, key)↵
return root
class TreeNode:↵
def __init__(self, key):↵
self.key = key↵
self.left = None↵
self.right = None↵
↵
def insert(root, key):↵
if root is None:↵
return TreeNode(key)↵
if key < root.key:↵
root.left = insert(root.left, key)↵
elif key > root.key:↵
root.right = insert(root.right, key)↵
return root
