Write routine to list out the nodes of a binary tree in level-order. List the root, then nodes at depth 1,

followed by nodes at depth 2, and so on, You must do this in linear time. Prove your time bound.

please someone help me to solve this question in java