CLASS 005 - Trees - Find, Insert, Delete

//Pseudocode, depth first search
find(n):bool
	if !n
		return false;
	if node.value = v
		return true;
	if node.value < v
		return find(node.right.value);
	return find(node.left.value);

//pseudocode, depth first insert
insert(node, v)
	if (node.v) < v
		insert(node.r, v);
	else if (node.v >= v)
		insert(node.l, v);