human
Binary Search Tree | Set 1 ( Search and Insertion ) | A utility function to search a given key in BST.
Base Cases : root is null or key is present at root.
Key is greater than root 's key.
Key is smaller than root 's key"
Solution in Python:
 ... What is a code to binary Search Tree and the other steps required?
assistant
#Here is code to binary Search Tree and the other steps required.
 def search ( root , key ) :
	if root is None or root . val == key :
		return root
	if root . val < key :
		return search ( root . right , key )
	return search ( root . left , key )