Binary Tree Paths

最新推荐文章于 2024-11-03 20:00:49 发布

kyowill

最新推荐文章于 2024-11-03 20:00:49 发布

阅读量450

点赞数

CC 4.0 BY-SA版权

分类专栏： LTOJ

本文链接：https://blog.youkuaiyun.com/yangkaikwill/article/details/47752725

LTOJ 专栏收录该内容

91 篇文章

订阅专栏

本文介绍了如何使用递归算法来查找给定二叉树的所有根到叶节点路径，并提供了详细实现步骤。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

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:
    void helper(vector<string> &svec, string s, TreeNode *root)
    {

        if(root -> left == NULL && root -> right == NULL)
        {
            int t = root -> val;
            char p[256];
            sprintf(p, "%d", t);
            s += p;
            svec.push_back(s);
        }
        int t = root -> val;
        char p[256];
        sprintf(p, "%d", t);
        s += p;
        
        if(root -> left)
        {
            helper(svec, s + "->", root -> left);
        }
        if(root -> right)
        {
            helper(svec, s + "->", root -> right);
        }
    }
    vector<string> binaryTreePaths(TreeNode* root)
    {
        vector<string> svec;
        if(root == NULL)
        {
            return svec;
        }
        helper(svec, "", root);   
        return svec; 
    }
};