>>> root = TreeNode(1) >>> tree_node2 = TreeNode(2) >>> tree_node3 = TreeNode(3) >>> tree_node4 = TreeNode(4) >>> tree_node5 = TreeNode(5) >>> tree_node6 = TreeNode(6) >>> tree_node7 = TreeNode(7) >>> root.left, root.right = tree_node2, tree_node3 >>> tree_node2.
(node: TreeNode)
| 106 | |
| 107 | |
| 108 | def level_order(node: TreeNode) -> None: |
| 109 | """ |
| 110 | >>> root = TreeNode(1) |
| 111 | >>> tree_node2 = TreeNode(2) |
| 112 | >>> tree_node3 = TreeNode(3) |
| 113 | >>> tree_node4 = TreeNode(4) |
| 114 | >>> tree_node5 = TreeNode(5) |
| 115 | >>> tree_node6 = TreeNode(6) |
| 116 | >>> tree_node7 = TreeNode(7) |
| 117 | >>> root.left, root.right = tree_node2, tree_node3 |
| 118 | >>> tree_node2.left, tree_node2.right = tree_node4 , tree_node5 |
| 119 | >>> tree_node3.left, tree_node3.right = tree_node6 , tree_node7 |
| 120 | >>> level_order(root) |
| 121 | 1,2,3,4,5,6,7, |
| 122 | """ |
| 123 | if not isinstance(node, TreeNode) or not node: |
| 124 | return |
| 125 | q: queue.Queue = queue.Queue() |
| 126 | q.put(node) |
| 127 | while not q.empty(): |
| 128 | node_dequeued = q.get() |
| 129 | print(node_dequeued.data, end=",") |
| 130 | if node_dequeued.left: |
| 131 | q.put(node_dequeued.left) |
| 132 | if node_dequeued.right: |
| 133 | q.put(node_dequeued.right) |
| 134 | |
| 135 | |
| 136 | def level_order_actual(node: TreeNode) -> None: |
no test coverage detected