def level_order(root) result = [] return result if root.nil? queue = [] queue << root until queue.empty? level_size = queue.length level = [] level_size.times do node = queue.shift level << node.val queue << node.left unless node.left.nil? queue << node.right unless node.right.nil? end result << level end result.reverse! end