二叉树的所有路径

给一棵二叉树，找出从根节点到叶子节点的所有路径。

/**
 * Definition of TreeNode:
 * class TreeNode {
 * public:
 *     int val;
 *     TreeNode *left, *right;
 *     TreeNode(int val) {
 *         this->val = val;
 *         this->left = this->right = NULL;
 *     }
 * }
 */

class Solution {
public:
    /**
     * @param root: the root of the binary tree
     * @return: all root-to-leaf paths
     */
    vector<string> binaryTreePaths(TreeNode * root) {
        // write your code here
        vector<string> ret;
        if(root == NULL)
        {
            return ret;
        }
        TreeNode* p = root;
        TreeNode* r;
        int sum = 0;
        bool flag;
        stack<TreeNode*> s1;
        stack<TreeNode*> s2;
        do
        {
            while(p != NULL)
            {
                s1.push(p);
                s2.push(p);
                p = p->left;
            }  //找到最左下角的节点,这个节点没有左子树
           
            r = NULL;
            flag = true;
            //cout<<"s1.size() = "<<s1.size()<<endl;
            //cout<<"s2.size() = "<<s2.size()<<endl;
            
            while(!s1.empty() && flag)
            {
                p = s1.top();
                if(p->right == r)
                {
                    if(p->left == NULL && p->right == NULL)     //叶子节点
                    {
                        string tmp1;
                        //int numtmp = 0;
                        for(int i = 0; i<s1.size(); i++)
                        {
                            //tmp = tmp + s2.pop->val;
                            TreeNode* tmp = s2.top();
                            tmp1 = "->" + std::to_string(tmp->val) + tmp1;
                            //tmp1 = "->" + tmp1;
                            //numtmp = numtmp + (tmp->val)*pow(10,i);
                            //cout<<"numtmp = "<<numtmp<<endl; 
                            s2.pop();
                        }
                        ret.push_back(tmp1);
                        //sum = sum + numtmp;
                        //cout<<"sum = "<<sum<<endl;
                        
                    }
                    s2 =s1;
                    p = s1.top();
                    r = p;
                    s1.pop();
                    s2.pop();
                    
                    
                }
                else
                {
                     p = p->right;
                     flag = false;
                }
                
            }
            // return 1;
            
        }while(!s1.empty());
        
        for(int i = 0; i <  ret.size(); i++)
        {
            ret[i].erase(0,2);
        }
        
        return ret;
    }
};

样例

样例 1:

输入：{1,2,3,#,5}
输出：["1->2->5","1->3"]
解释：
   1
 /   \
2     3
 \
  5

样例 2:

输入：{1,2}
输出：["1->2"]
解释：
   1
 /   
2