leetcode---Binary Tree Paths

二叉树路径遍历

最新推荐文章于 2021-03-26 00:00:42 发布

谛听-

最新推荐文章于 2021-03-26 00:00:42 发布

阅读量327

点赞数

CC 4.0 BY-SA版权

分类专栏：题树

本文链接：https://blog.youkuaiyun.com/u012319493/article/details/51383349

题同时被 2 个专栏收录

456 篇文章

订阅专栏

树

46 篇文章

订阅专栏

本文介绍了一种算法，用于获取给定二叉树的所有从根节点到叶子节点的路径。通过递归方法，该算法能有效地收集每条路径，并以字符串形式返回所有可能的路径集合。

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

/**
 * 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> paths;
    vector<string> binaryTreePaths(TreeNode* root) {
        if(root != NULL)
        {
            string val;
            stringstream ss;
            ss << root->val;
            ss >> val;
            findPath(root, val);
        }
        return paths;
    }

    void findPath(TreeNode* root, string path)
    {
        if(root->left==NULL && root->right==NULL)
            paths.push_back(path);
        if(root->left != NULL)
        {
            string val;
            stringstream ss;
            ss << root->left->val;
            ss >> val;
            findPath(root->left, path+"->"+val);
        }
        if(root->right != NULL)
        {
            string val;
            stringstream ss;
            ss << root->right->val;
            ss >> val;
            findPath(root->right, path+"->"+val);
        }
    }
};