Implemented breadth first search of BinaryTree using a new Queue data structure. Queue is implemented in terms of LinkedList. Added mpLastNode pointer to LinkedList for efficient implementation of the Queue. Removed the fRootOfTree variable from the traverse method of BinaryTree. Since it's now using member function pointers, the functions themselves can compare against mpRootNode if they want. No existing traversal function used fRootOfTree anyway.