'lintcode 二叉树的所有路径'

lintcode 二叉树的所有路径

每日一练 加油

描述

给一棵二叉树，找出从根节点到叶子节点的所有路径。

样例

给出下面这棵二叉树：

1
/ \
2 3
\
5

所有根到叶子的路径为：

[
“1->2->5”,
“1->3”
]

思路:

对于某一个根节点root，他的左右子树都会分别产生2个路径的集合vector left 和right 那么只需要把这两个集合里所有的路径的头部添加一下root，再把两个vector合并即可。
空结点和叶节点处理一下就完成了

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 40

/** * Definition of TreeNode: * class TreeNode { * public: * int val; * TreeNode *left, *right; * TreeNode(int val) { * this->val = val; * this->left = this->right = NULL; * } * } */ class Solution { public: /** * @param root: the root of the binary tree * @return: all root-to-leaf paths */ vector<string> binaryTreePaths(TreeNode * root) { // write your code here vector<string> res; if (!root) return res; if (root->left == NULL && root->right == NULL) res.push_back(to_string(root->val)); string head = to_string(root->val); vector<string> left = binaryTreePaths(root->left), right = binaryTreePaths(root->right); for (int i = 0; i < left.size(); i++) left[i] = head + "->" + left[i]; for (int i = 0; i < right.size(); i++) right[i] = head + "->" + right[i]; res.insert(res.end(), left.begin(), left.end()); res.insert(res.end(), right.begin(), right.end()); return res; } };

-------------end of file thanks for reading-------------