Create a binary tree class.

-Data array field (private)

-Count field

Add method(data)

-The add method takes a data point, add it to the count position in the array then increases the count.

Print method(void)

-Prints all the fields in the tree.

-Extend the class adding these methods:

(Remember 2i + 1 & 2i + 2)

Preorder(int)

-Recursive method that prints all the nodes in a VLR pattern.

Inorder(int)

-Recursive method that prints all the nodes in a LVR pattern.

Postorder(int)

-Recursive method that prints all the nodes in a LRV pattern.

In java or c++