(node)
| 73 | |
| 74 | |
| 75 | def level_order(node): |
| 76 | if not isinstance(node, TreeNode) or not node: |
| 77 | return |
| 78 | q = queue.Queue() |
| 79 | q.put(node) |
| 80 | while not q.empty(): |
| 81 | node_dequeued = q.get() |
| 82 | print(node_dequeued.data, end=" ") |
| 83 | if node_dequeued.left: |
| 84 | q.put(node_dequeued.left) |
| 85 | if node_dequeued.right: |
| 86 | q.put(node_dequeued.right) |
| 87 | |
| 88 | |
| 89 | def level_order_actual(node): |
no test coverage detected