-
Notifications
You must be signed in to change notification settings - Fork 1
/
257_binaryTreePaths.cpp
39 lines (35 loc) · 1.01 KB
/
257_binaryTreePaths.cpp
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
// Sourse : https://leetcode.com/problems/binary-tree-paths/
// Difficulty : Easy
/***********************************************************************
*
* Given a binary tree, return all root-to-leaf paths.
*
**********************************************************************/
/**
* 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) {
if (!root) return vector<string>();
vector<string> ans;
dfs(ans, "", root);
return ans;
}
void dfs(vector<string>& ans, string str, TreeNode* node) {
str += to_string(node->val);
if (!node->left && !node->right) {
ans.push_back(str);
return;
}
str += "->";
if (node->left) dfs(ans, str, node->left);
if (node->right) dfs(ans, str, node->right);
}
};