here is the question
Specify and design, and implement a class for binary trees where the nodes are stored in an array list, similar to the way that a complete binary tree is usually stored. However, these binary tree do not need to be complete. The class should have methods to create the first node and to move cursor around the tree. After the first node, new nodes may be added only as children of the cursor.