// RecursiveSearch search a key from tree recursively.
RecursiveSearch search a key from tree recursively.
// RecursiveSearch search a key from tree recursively .
func RecursiveSearch(targetNode *Node, key int) bool {
	if targetNode == nil {
		return false
	}
	if key < targetNode.Key {
		return RecursiveSearch(targetNode.Left, key)
	}
	if key > targetNode.Key {
		return RecursiveSearch(targetNode.Right, key)
	}
	return true
}
func RecursiveSearch ( targetNode * Node , key int ) bool { if targetNode == nil { return false } if key < targetNode . Key { return RecursiveSearch ( targetNode . Left , key ) } if key > targetNode . Key { return RecursiveSearch ( targetNode . Right , key ) } return true }
RecursiveSearch search a key from tree recursively.
RecursiveSearch search a key from tree recursively .
// if key is smaller then target node, next time start searching from left node. // if key is higher then target node, next time start searching from right node.