"Data structure" binary tree hierarchy traversal

 PackageBlue Bridge Practice; Public  class two fork tree hierarchy traversal {     Public Static intMAXSIZE = -; Public StaticNode queue[] =NewNode[maxsize]; Public Static void Main(string[] args) {Node h =NewNode (' H ',NULL,NULL); Node i =NewNode (' I ',NULL,NULL); Node f =NewNode (' F ', h, i); Node g =NewNode (' G ',NULL,NULL); Node d =NewNode (' D ',NULL,NULL); Node e =NewNode (' E ',NULL,NULL); Node B =NewNode (' B ', D, E); Node C =NewNode (' C ', F, G); Node A =NewNode (' A ', b, c);    Level (a); }/** * Hierarchy traverse binary tree * @param P */    Private Static void  Level(Node p) {intFront, rear; Front = Rear =0; Node Q;if(P! =NULL) {rear = (rear +1)% MAXSIZE; Queue[rear] = p; while(Front! = rear) {Front = (front +1)% MAXSIZE;                Q = Queue[front]; System.out.print (Q.key +" ");if(Q.leftnode! =NULL) {rear = (rear +1)% MAXSIZE;                Queue[rear] = Q.leftnode; }if(Q.rightnode! =NULL) {rear = (rear +1)% MAXSIZE;                Queue[rear] = Q.rightnode; }}}}}class Node { Public CharKey PublicNode Leftnode; PublicNode Rightnode; Public Node(CharKey) { This(Key,NULL,NULL); } Public Node(CharKey, node Leftnode, node Rightnode) { This. key = key; This. Leftnode = Leftnode; This. Rightnode = Rightnode; }}

"Data structure" binary tree hierarchy traversal