Binary Search Tree

Tree T is a binary search tree made up of n elements: x0 x1 x2 x3 ... xn-1   

Functions:
createEmptyTree()  returns a newly created empty binary tree
delete(T, p)  	   removes the node pointed to by p from the tree T
insert(T, p)	   returns T with the node pointed to by p added in 
                   the proper location 
search(T, key)	   returns a pointer to the node in T that has a key 
                   that matches key
 		   returns null if the node is not found 
traverse(T)	   prints the contents of T in order
isEmptyTree(T)	   returns true if T is empty and false if it is not