Create an implementation of a binary tree using the recursive approach introduced in the chapter. In this approach, each node is a binary tree. Thus a binary tree contains a reference to the element stored at its root, as well as references to its left and right subtrees. You may also want to include a reference to its parent.