描述
找出从根节点到叶子结点的路径
解决
左右递归
/**
* Definition for a binary tree node.
* struct TreeNode {
* int val;
* TreeNode *left;
* TreeNode *right;
* TreeNode(int x) : val(x), left(NULL), right(NULL) {}
* };
*/
class Solution {
public:
vector<string> res;
vector<string> binaryTreePaths(TreeNode* root) {
string str;
if (!root)
return {};
help(root, str);
return res;
}
void help(TreeNode *tmp, string str)
{
if (tmp == NULL)
return ;
if (tmp -> left == NULL && tmp -> right == NULL)
{
str +=to_string(tmp -> val);
res.push_back(str);
return ;
}
help(tmp-> left ? tmp -> left : NULL, str + to_string(tmp -> val) + "->");
help(tmp -> right ? tmp -> right : NULL, str + to_string(tmp -> val) + "->");
}
};