递归实现二叉树的层序遍历
时间: 2024-01-07 18:22:03 浏览: 47
<<引用[1]:https://leetcode***-order-traversal/solution/di-gui-python-by-jason-2/。引用:https://www.geeksforgeeks.org/level-order-tree-traversal/。引用:https://www.tutorialspoint.com/data_structures_algorithms/tree_traversal.htm。>>
以下是使用递归实现二叉树的层序遍历的Python代码示例:
```python
class TreeNode:
def __init__(self, value=0, left=None, right=None):
self.value = value
self.left = left
self.right = right
def levelOrderTraversal(root):
result = []
def helper(node, level):
if node:
if len(result) < level + 1:
result.append([])
result[level].append(node.value)
helper(node.left, level + 1)
helper(node.right, level + 1)
helper(root, 0)
return result
```