For this assignment, you will be completing the implementation of an unsorted, complete, and iterable binary tree, which can is always accessed (when adding elements, iterating, etc.) in level ordering . That is, if we create such a tree, and add the integers 1 through 6 to it, it will be a perfect tree down to the bottom level, at which point, it will be filled left-to-right:
More Details in PDF file.