Binary Search Tree - Python

test1.py

class node():
	def __init__(self,val):
		self.left = None
		self.right = None
		self.value = val

def insert(root,val):
	if root is None:
		root = node(val)
	else:
		if val < root.value:
			if root.left is None:
				root.left = node(val)
			else:
				insert(root.left,val)
			
		elif val > root.value:
			if root.right is None:
				root.right = node(val)
			else:
				insert(root.right,val)

def traverse(root):
	if root is None:
		return
	else:
		print(root.value)
		traverse(root.left)
		traverse(root.right)

r = node(5)
insert(r,3)
insert(r,8)
insert(r,1)
insert(r,6)
traverse(r)