The sword refers to the offer (49) of the binary tree and the path to a value

Title Description

Enter a binary tree and an integer to print out all paths for the value of the node in the two-fork tree and for the input integer. A path is defined as a path from the root node of the tree down to the node through which the leaf nodes go.

Code:

<span style= "color: #000099;"    >import Java.util.arraylist;/**public class TreeNode {int val = 0;    TreeNode left = null;    TreeNode right = null;    Public TreeNode (int val) {this.val = val; }}*/public class Solution {private arraylist<arraylist<integer>> Listall = new Arraylist<arraylist<i    Nteger>> ();    Private arraylist<integer> list = new arraylist<integer> (); Public arraylist<arraylist<integer>> Findpath (TreeNode root,int target) {if (root = null) return ListA        ll        List.add (Root.val);        Target-= Root.val; if (target = = 0 && Root.left = = NULL && root.right = null) listall.add (new Arraylist<integer        > (list));        Findpath (Root.left, target);        Findpath (root.right, target);        List.remove (List.size ()-1);    return listall; }}</span>

Sword refers to the binary tree of Offer (49) and the path to a value