在Python中以列表的形式获取二叉树的所有分支(从根到叶

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

def binary_tree_paths(root):
    if not root:
        return []
    
    def dfs(node, path, result):
        if not node.left and not node.right:
            result.append(path + [node.val])
            return
        
        if node.left:
            dfs(node.left, path + [node.val], result)
        
        if node.right:
            dfs(node.right, path + [node.val], result)
    
    result = []
    dfs(root, [], result)
    return result

# 构建二叉树
root = TreeNode(1)
root.left = TreeNode(2)
root.right = TreeNode(3)
root.left.right = TreeNode(5)

# 获取二叉树的所有分支
branches = binary_tree_paths(root)
print(branches)

[[1, 2, 5], [1, 3]]