Denaw8419go Denaw8419go Computers and Technology Answered write a 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.