21(14 p) Aheth first rveal of a hinary tree visits ach node of the tree level by level, staurting with the ee's rot node which in at evel o On each level, the nodes are visie lefit to right For ample, in the e below, a breadth finst traversal of the nodes is: 5,3,7.2,4,61 Level O evel 1 Level 2 Level Wrihethe code for the method breathFineTravnal of the Binary Tre clas) which creanes a list of the ,ofte binary tree in teeadth finterde' Below are all the methods f om the BinaryTree class and its nested Node class which you might need to write the code for this ie class BinarytreecAnyType rivate statie class Node-Anytype private Anytype data private NodecAnytypex left: private Node-Anytypex right public Anytype getData) (return data publie Mode