二叉树的所有路径python(leetcode257)

# 257. 二叉树的所有路径

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, val=0, left=None, right=None):
#         self.val = val
#         self.left = left
#         self.right = right

class Solution(object):
    def binaryTreePaths(self, root):
        """
        :type root: TreeNode
        :rtype: List[str]
        """
        # 不考虑空节点情况，题目已知节点数目至少为1
        # 前序遍历，中左右，代码是中右左
        stack, path_st, res = deque([root]), deque(), []
        path_st.append(str(root.val))
        while stack:
            cur = stack.pop()
            path = path_st.pop()
            if not cur.left and not cur.right:
                res.append(path)
            if cur.right:
                stack.append(cur.right)
                path_st.append(path + '->' + str(cur.right.val))
            if cur.left:
                stack.append(cur.left)
                path_st.append(path + '->' + str(cur.left.val))
        return res