Python program to demonstrate insert operation in binary search tree

class Node:
def __init__(self,key):
self.left = None
self.right = None
self.value = key
def insert(root,node):
if root is None:
root=node
else:
if root.value<node.value:
if root.right is None:
root.right=node
else:
insert(root.right,node)
else:
if root.left is None:
root.left = node
else:
insert(root.left,node)
def inorder(root):
if root:
inorder(root.left)
print(root.value)
inorder(root.right)
root=Node(9)
insert(root,Node(5))
insert(root,Node(2))
insert(root,Node(4))
insert(root,Node(11))
inorder(root)

Output: