Write a function 1eve1ByLeve10 to traverse a tree level by level; that is, first visit the root, then all nodes on level 1 (children of the root), then all nodes on level 2, and so on.
Nodes on the same level should be visited in order from left to right. (Hint: Write a no recursive function, and use a queue of pointers.)