深度优先遍历,数的先序遍历
/*
* @lc app=leetcode.cn id=129 lang=cpp
*
* [129] 求根节点到叶节点数字之和
*/
// @lc code=start
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode() : val(0), left(nullptr), right(nullptr) {}
* TreeNode(int x) : val(x), left(nullptr), right(nullptr) {}
* TreeNode(int x, TreeNode *left, TreeNode *right) : val(x), left(left), right(right) {}
* };
*/
class Solution {
public:
/* 二叉树的先序遍历*/
int result = 0;
int sumNumbers(TreeNode* root) {
int sum = 0;
result = 0;
deep(root,sum);
return result;
}
void deep(TreeNode* root,int sum){
if(root==nullptr){
return ;
}
if(root->left==nullptr&&root->right==nullptr){
result+=sum*10+root->val;
return;
}
sum*=10;
sum += root->val;
if(root->left!=nullptr){
deep(root->left,sum);
}
if(root->right!=nullptr){
deep(root->right,sum);
}
}
};
// @lc code=end