Leetcode-标签为Tree 257. Binary Tree Paths

原题

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"]

题目分析

求二叉树的所有路径，输出路径图。递归求解。

代码实现

        public IList<string> BinaryTreePaths(TreeNode root)
        {
            if (root == null)
                return new List<string>();
            if (root.left == null && root.right == null)
                return new List<string> { root.val.ToString() };
            IList<string> rtn = new List<string>();
            IList<string> rtnleft =  BinaryTreePaths(root.left);//左子树路径
            foreach(var item in rtnleft)//左子树都继承于根节点
                rtn.Add(root.val + "->" + item);
            IList<string> rtnright = BinaryTreePaths(root.right);
            foreach (var item in rtnright)
                rtn.Add(root.val + "->" + item);
            return rtn;
        }

leetcode-solution库

leetcode算法题目解决方案每天更新在github库中，欢迎感兴趣的朋友加入进来，也欢迎star，或pull request。https://github.com/jackzhenguo/leetcode-csharp