class Solution { public: int recur(TreeNode* root, int sum, bool isHaveRoot) { if(root == NULL) return 0; int count = 0; int val = root->val; if(val == sum) count++; if(root->left) { // if haveroot, 则为保证路径连续,下个root也必须have ...