在 Python 中实现递归二叉树遍历时出现“超出最大递归深度”错误

Question

我正在尝试在 Python 中实现递归算法来遍历二叉树并按顺序打印出所有节点。但是，当我运行我的代码时，出现“超出最大递归深度”错误。

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

def inorder_traversal(root):
    if not root:
        return []
    result = []
    result += inorder_traversal(root.left)
    result.append(root.val)
    result += inorder_traversal(root.right)
    return result

root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.left = TreeNode(4)
root.left.right = TreeNode(5)

print(inorder_traversal(root))

Answer 1

设置递归限制。

import sys
sys.setrecursionlimit(n) # default is 1000, you probably want something like 3000