MiracleYoung#You-are-Pythonista#算法_16_从上往下打印二叉树1

# 算法_16_从上往下打印二叉树 ## Question 从上往下打印出二叉树的每个节点，同层节点从左至右打印。请完善以下代码 ``` class Solution: ​ def PrintFromTopToBottom(self, root): ​ if not root: ​ return [] ​ queue = [] ​ result = [] ​ queue.append(root) ​ while len(queue)