public class Node { //node class, the base of treeint data;int index;Node leftChild;Node rightChild;} import java.util.Scanner;/*** @author NEU 灏忓畤* @version 1.1*/public class TreeD
437. 路径总和 III - 力扣(LeetCode) 前序遍历时,维护当前路径(根节点开始)的路径和,同时记录路径上每个节点的路径和 假设当前路径和为cur,那么ans += 路径和(cur - target)的出现次数 /*** Definition for a binary tree node.* struct TreeNode {* int val;* TreeNo