Binary Tree Paths Problem


Description

LeetCode Problem 257.

Given the root of a binary tree, return all root-to-leaf paths in any order.

A leaf is a node with no children.

Example 1:

1
2
Input: root = [1,2,3,null,5]
Output: ["1->2->5","1->3"]

Example 2:

1
2
Input: root = [1]
Output: ["1"]

Constraints:

  • The number of nodes in the tree is in the range [1, 100].
  • -100 <= Node.val <= 100


Sample C++ Code

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
class Solution {
public:
    void dfs(TreeNode* root, vector<string> &result, string s) {
        if (root->left == NULL && root->right == NULL) {
            result.push_back(s);
            return;
        }
        if (root->left)
            dfs(root->left, result, s + "->" + to_string(root->left->val));
        if (root->right)
            dfs(root->right, result, s + "->" + to_string(root->right->val));
        return;
    }
    vector<string> binaryTreePaths(TreeNode* root) {
        vector<string> result;
        if (root == NULL)
            return result;
        dfs(root, result, to_string(root->val));
        return result;
    }
};




Related Posts

Vertical Order Traversal Of A Binary Tree Problem

LeetCode 987. Given the root of a binary tree, calculate...

Univalued Binary Tree Problem

LeetCode 965. A binary tree is uni-valued if every node...

Sum Of Distances In Tree Problem

LeetCode 834. There is an undirected connected tree with n...

Smallest Subtree With All The Deepest Nodes Problem

LeetCode 865. Given the root of a binary tree, the...

Smallest String Starting From Leaf Problem

LeetCode 988. You are given the root of a binary...

Similar String Groups Problem

LeetCode 839. Two strings Xand Yare similar if we can...