257. 二叉树的所有路径 03.23 (二)

给你一个二叉树的根节点 root ，按 任意顺序 ，返回所有从根节点到叶子节点的路径。

叶子节点 是指没有子节点的节点。

 

示例 1：

输入：root = [1,2,3,null,5]
输出：["1->2->5","1->3"]

示例 2：

输入：root = [1]
输出：["1"]

提示：

• 树中节点的数目在范围 [1, 100] 内
• -100 <= Node.val <= 100

• /**
   * Definition for a binary tree node.
   * public class TreeNode {
   *     public int val;
   *     public TreeNode left;
   *     public TreeNode right;
   *     public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
   *         this.val = val;
   *         this.left = left;
   *         this.right = right;
   *     }
   * }
   */
  public class Solution {
      public IList<string> BinaryTreePaths(TreeNode root) {
          List<string> paths = new List<string>();
          BBB(root,"",paths);
          return paths;
      }
      public void BBB(TreeNode root,string path,List<string> paths){
          if(root == null) return ;
          StringBuilder sb = new StringBuilder(path);
          sb.Append(root.val.ToString());
          if(root.left == null && root.right == null){
              paths.Add(sb.ToString());
          }
          else{
              sb.Append("->");
              BBB(root.left,sb.ToString(),paths);
              BBB(root.right,sb.ToString(),paths);
          }
      }
  }

  /**
   * Definition for a binary tree node.
   * public class TreeNode {
   *     public int val;
   *     public TreeNode left;
   *     public TreeNode right;
   *     public TreeNode(int val=0, TreeNode left=null, TreeNode right=null) {
   *         this.val = val;
   *         this.left = left;
   *         this.right = right;
   *     }
   * }
   */
  public class Solution {
      public IList<string> BinaryTreePaths(TreeNode root) {
          List<string> paths = new List<string>();
          BBB(root,"",paths);
          return paths;
      }
      public void BBB(TreeNode root,string path,List<string> paths){
          if(root == null) return ;
          path += root.val.ToString();
          if(root.left == null && root.right == null){
              paths.Add(path);
          }
          else{
              BBB(root.left,path+"->",paths);
              BBB(root.right,path+"->",paths);
          }
      }
  }