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 {
vector<TreeNode*> pathNodes;
vector<string> paths;
public:
vector<string> binaryTreePaths(TreeNode* root) {
if(root)
{
pathNodes.push_back(root);
if(root->left || root->right)
{
if(root->left)
binaryTreePaths(root->left);
if(root->right)
binaryTreePaths(root->right);
pathNodes.pop_back(); //去掉搜索过左右子节点的父节点
}
else
{
//string
string temp="";
for(int i = 0; i < pathNodes.size();i++)
{
char tempStr[100]="";
sprintf(tempStr, "%d", pathNodes[i]->val);
temp+= tempStr;
temp+="->";
}
temp = temp.substr(0,temp.length()-2);
paths.push_back(temp);
pathNodes.pop_back();
}
}
return paths;
}
};