Data Structures.

Using the linknode binary tree implementation given in the textbook.

Build, debug and test the code with a testdriver.

Then implement the following methods in the header comments of the method describe the methods time complexity:

getRoot(), size(), isEmpty(), isLeaf(), isInternal(), depth()

Create a test driver to test each of these methods.

Create a zip file and submit.