BinaryTreeExample.js

find (root, 3)

find(node current, Data value)

	if (current.value == null) {
		return null;
	}

	if else(current.value == value) {
		return current
	}

	if else(value < current.value) {
		return find(current.value, left)
	}

	return find(current.right, value)

}