如何在不跟踪全局索引的情况下将BST的节点数据递归存储到全局数组中

# 定义二叉树节点类
class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
        self.right = right

# 中序遍历BST并将节点数据存储到全局数组中
def inorder_traversal(root, result):
    if root:
        inorder_traversal(root.left, result)
        result.append(root.val)
        inorder_traversal(root.right, result)

# 创建BST并调用中序遍历函数
def store_bst_data_in_array(root):
    result = []
    inorder_traversal(root, result)
    return result

# 示例用法
# 创建一个BST
root = TreeNode(4)
root.left = TreeNode(2)
root.right = TreeNode(6)
root.left.left = TreeNode(1)
root.left.right = TreeNode(3)
root.right.left = TreeNode(5)
root.right.right = TreeNode(7)

# 调用函数将BST的节点数据存储到全局数组中
data_array = store_bst_data_in_array(root)

# 打印结果
print(data_array)