题目描述: Given a binary tree, return thelevel ordertraversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree{3,9,20,#,#,15,7}, 3/ \9 20/ \15 7 return its level order traversal as: [[3],[9,20],[15
时间:2023-09-05 | 阅读:338