要求:如题
思路:回溯dfs,bfs也可以,dfs写法上业可以改为一进来非空则加路径,注意这种二叉树遍历型题目不需要visited
/**
* 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:
vector<string> v;
void dfs(TreeNode* root,string tmp){
if(!root->left&&!root->right)v.push_back(tmp);
if(root->left)
dfs(root->left,tmp+"->"+to_string(root->left->val));
if(root->right)
dfs(root->right,tmp+"->"+to_string(root->right->val));
}
vector<string> binaryTreePaths(TreeNode* root) {
dfs(root,to_string(root->val));
return v;
}
};