[leetcode]257. Binary Tree Paths

[leetcode]257. Binary Tree Paths

---

Analysis

paper的噩梦似乎又要开始了~—— [ummmm~]

Given a binary tree, return all root-to-leaf paths.
从上往下打印二叉树的路径

Implement

/**
 * 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) {
        DFS(root, "");
        return res;
    }
    void DFS(TreeNode* root, string cur){
        if(root == NULL)
            return ;
        cur += to_string(root->val);
        if(root->left == NULL && root->right == NULL)
            res.push_back(cur);
        DFS(root->left, cur+"->");
        DFS(root->right, cur+"->");
    }

private:
    vector<string> res;
};