码迷,mamicode.com
首页 > 其他好文 > 详细

【LeetCode】257 - Binary Tree Paths

时间:2015-08-16 18:01:24      阅读:117      评论:0      收藏:0      [点我收藏+]

标签:

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

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:
    void binaryTreePaths(vector<string>& result, TreeNode* node, string s) {
        if(!node->left && !node->right){
            result.push_back(s);
            return ;
        }
        if(node->left)binaryTreePaths(result, node->left, s+"->"+to_string(node->left->val));
        if(node->right)binaryTreePaths(result, node->right, s+"->"+to_string(node->right->val));
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> ret;
        if(!root)return ret;
        
        binaryTreePaths(ret, root, to_string(root->val));
        return ret;
    }
};

 

【LeetCode】257 - Binary Tree Paths

标签:

原文地址:http://www.cnblogs.com/irun/p/4734587.html

(0)
(0)
   
举报
评论 一句话评论(0
登录后才能评论!
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!