257. Binary Tree Paths 二叉树的路径

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"]

给定二叉树，返回其所有根到叶的路径。

思路

先序遍历递归，遍历节点的时候将val加入路径，遇到叶节点则将路径加入结果

/**

 * 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 buildTreePaths(vector<string>& result, TreeNode *root, string p){

        if(!root->left && !root->right){

            result.push_back(p);

            return;

        }

        if(root->left)   buildTreePaths(result, root->left, p+"->"+to_string(root->left->val));

        if(root->right)   buildTreePaths(result, root->right, p+"->"+to_string(root->right->val));

    }

    vector<string> binaryTreePaths(TreeNode* root) {

        vector<string> result;

        if(!root)   return result;

        buildTreePaths(result,root,to_string(root->val));

        return result;

    }

};