---

👉🏻计算布尔二叉树的值

原题链接：计算布尔二叉树的值

mycode:

class Solution {
public:bool evaluateTree(TreeNode* root) {if(root->left==nullptr){if(root->val==0)return false;else return true;}else {bool left = evaluateTree(root->left);bool right = evaluateTree(root->right);if(root->val==2)return left||right;else return left&&right;}}
};

👉🏻求根节点到叶节点数字之和

原题链接：求根节点到叶节点数字之和

mycode:

class Solution {
public:int sumNumbers(TreeNode* root) {if(root==nullptr)return 0;return dfs(root,0);}int dfs(TreeNode* root,int presum){if(root==nullptr)return 0;presum=(presum*=10)+root->val;if(root->left==nullptr&&root->right==nullptr)return presum;int leftsum = dfs(root->left,presum);int rightsum = dfs(root->right,presum);return leftsum+rightsum;}
};