给定一个二叉树,返回所有从根节点到叶子节点的路径。
说明: 叶子节点是指没有子节点的节点。
- 递归(dfs)
/**
* 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 dfs(TreeNode* root, string s, vector<string> &res) {
if (!root)
return;
s += to_string(root->val);
if (!root->left && !root->right)
res.push_back(s);
else {
s += "->";
dfs(root->left, s, res);
dfs(root->right, s, res);
}
}
vector<string> binaryTreePaths(TreeNode* root) {
vector<string> res;
dfs(root, "", res);
return res;
}
};
- 非递归
vector<string> binaryTreePaths(TreeNode* root) {
vector<string> ans;
if(root==NULL) return ans;
TreeNode* p=root;
stack<pair<TreeNode*,string>> s;
string str;
while(!s.empty()||p)
{
while(p)
{
if(p==root) str=str+to_string(p->val);
else str=str+"->"+to_string(p->val);
s.push(pair<TreeNode*,string>(p,str));
p=p->left;
}
p=s.top().first;
str=s.top().second;
s.pop();
if(p->right==NULL&&p->left==NULL) ans.push_back(str);
p=p->right;
}
return ans;
}