LeetCode 257
Binary Tree Paths
Problem Description:
输出二叉树从根节点到叶节点的所有路径
具体的题目信息:
https://leetcode.com/problems/binary-tree-paths/description/- Example:
- Solution:
- 解题思路:本题可直接用非递归后序遍历来实现。
- 编程实现:
/**
* 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> binaryTreePaths(TreeNode* root) {
vector<string> result;
if (root == NULL)
return result;
TreeNode* pre = NULL;
TreeNode* cur = root;
stack<TreeNode*> node;
vector<int> num;
string temp = "";
while(cur || !node.empty()) {
while(cur) {
node.push(cur);
num.push_back(cur->val);
cur = cur->left;
}
cur = node.top();
if (cur->left == NULL&&cur->right == NULL) {
for (int i = 0; i < num.size(); i++) {
if (i != 0) {
temp += "->";
}
stringstream ss;
ss << num[i];
temp += ss.str();
}
result.push_back(temp);
temp = "";
}
if (cur->right && cur->right != pre) {
cur = cur->right;
} else {
pre = cur;
cur = NULL;
node.pop();
num.pop_back();
}
}
return result;
}
};