BST Recursive Pseudocode

gistfile1.py

def insertNode(root, newNode, data):
	if root is null:
		root = newNode
		root.data = data
	elif data < root.left:
		root.left = insertNode(root.left, newNode, data);
	else:
		root.right = insertNode(root.right, newNode, data);
	return root
	
def traverseNode(root, array, counter):
	if root is null:
		return;
	
	traverseNode(root.left, array, counter)
	array[counter] = root.data
	traverseNode(root.right, array, counter)
	return