Tree traversal help

[lewang3]

I want an algorithm that lists out the nodes of a binary tree in level-order. Listing the root, nodes at depth 1,nodes at depth 2, and so on using array or linked-list .How can I do this in linear time.thanks in advance