257. Binary Tree Paths
- Total Accepted: 70120
- Total Submissions: 214949
- Difficulty: Easy
Given a binary tree, return all root-to-leaf paths.
For example, given the following binary tree:
1 / \ 2 3 \ 5
All root-to-leaf paths are:
["1->2->5", "1->3"]
解题思路:
此题即找出所有从根节点到叶节点的路径,使用递归遍历的方法即可解决。
代码展示:
/**
* 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:
void ans(vector<string> &answ,TreeNode* root,string tans)
{
if(root->left==NULL&&root->right==NULL)
{
//如果是叶结点则将结果保存到向量answ中
answ.push_back(tans);
return;
}
if(root->left!=NULL)
{
//如果左子树非空,则加上左子树的值,然后继续递归遍历
//此时不能写为 tans+ = "->"+to_string(root->left->val);
//这样写会改变trans的值,在右子树非空时,遍历右子树时trans值会包含左子树结点
ans(answ,root->left,tans+"->"+to_string(root->left->val));
}
if(root->right!=NULL)
{
ans(answ,root->right,tans+"->"+to_string(root->right->val));
}
}
vector<string> binaryTreePaths(TreeNode* root) {
vector<string> answ;
if(root!=NULL)
{ string tmp="";
tmp+=to_string(root->val);
ans(answ,root,tmp);
}
return answ;
}
};