A Easy Java Question

Implement the getSize(), getHeight() and toList() methods in the following BinaryTree class.

import java.util.List;

public class BinaryTree { private BinaryTree left; private BinaryTree right; private T data;

public BinaryTree(T data) { this.data = data; }

public T getData() { return data; }

public void setLeft(BinaryTree left) { this.left = left; }

public void setRight(BinaryTree right) { this.right = right; }

/* @description This method recursively computes the size of the binary tree * @return an integer >= 1 equal to the number of nodes in the binary tree * rooted at this node. */ public int getSize() { int count; while() // WRITE CODE HERE } /* @description This method recursively computes the height of the binary tree * @return an integer >= 0 equal to the height of the binary tree * rooted at this node. */ public int getHeight() {

// WRITE CODE HERE } /* @description This method recursively appends all data stored in this * binary tree using an inorder traversal * @param a List where all items are to be appeded during an inorder * traversal. */ public void toList(List list) {

// WRITE CODE HERE

} }