Leetcode 257. Binary Tree Paths

二叉树路径查找算法

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

原创最新推荐文章于 2024-11-03 20:00:49 发布 · 179 阅读

0 ·

CC 4.0 BY-SA版权

文章标签：

#Leetcode

Leetcode 同时被 2 个专栏收录

409 篇文章

订阅专栏

Algorithm

260 篇文章

订阅专栏

本文介绍了一种用于查找二叉树所有根节点到叶子节点路径的算法，并提供了递归和迭代两种实现方式。该算法适用于计算机科学和数据结构的学习者。

文章作者：Tyan
博客：noahsnail.com | 优快云 | 简书

1. Description

Binary Tree Paths

2. Solution

Recursive

/**
 * 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) {
        vector<string>  result;
        if(root == NULL) {
            return result;
        }
        searchPath(root, "", result);
        return result;
    }

    void searchPath(TreeNode* root, string s, vector<string>& result) {
        if(s == "") {
            s = to_string(root->val);
        }
        else {
            s = s + "->" + to_string(root->val);
        }
        if(root->left == NULL && root->right == NULL) {
            result.push_back(s);
            return;
        }
        if(root->left != NULL) {
            searchPath(root->left, s, result);
        }
        if(root->right != NULL) {
            searchPath(root->right, s, result);
        }
    }
};

Iterative

/**
 * 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) {
        vector<string>  result;
        if(root == NULL) {
            return result;
        }
        queue<TreeNode*> nodes;
        queue<string> paths;
        nodes.push(root);
        paths.push("");
        while(!nodes.empty()) {
            TreeNode* node = nodes.front();
            nodes.pop();
            string path = paths.front();
            paths.pop();
            if(path == "") {
                path = to_string(node->val);
            }
            else {
                path = path + "->" + to_string(node->val);
            }
            if(node->left == NULL && node->right == NULL) {
                result.push_back(path);
                continue;
            }
            if(node->left != NULL) {
                nodes.push(node->left);
                paths.push(path);
            }
            if(node->right != NULL) {
                nodes.push(node->right);
                paths.push(path);
            }
        }
        return result;
    }
};