标签：ack tree node null one title ref span ace class
Given a binary tree, return all root-to-leaf paths.
For example, given the following binary tree:
1 / 2 3 5
All root-to-leaf paths are:
["1->2->5", "1->3"]
# Definition for a binary tree node.# class TreeNode(object):# def __init__(self, x):# self.val = x# self.left = None# self.right = Noneclass Solution(object):def binaryTreePaths(self, root):if not root:return []result = []self.dfs(root, result, "")return resultdef dfs(self, node, result, string):if not node.left and not node.right:result.append(string + str(node.val))if node.left:self.dfs(node.left, result, string + str(node.val) + "->")if node.right:self.dfs(node.right, result, string + str(node.val) + "->")
标签：ack tree node null one title ref span ace class
原文地址：http://www.cnblogs.com/xiejunzhao/p/a01c0c7c89ae8905dca777b29325a874.html
