给定一个二叉树,返回所有从根节点到叶子节点的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
输入: 1 / \ 2 3 \ 5 输出: ["1->2->5", "1->3"] 解释: 所有根节点到叶子节点的路径为: 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:
vector<string> binaryTreePaths(TreeNode* root) {
vector<string> res;
if(root ==NULL) return res;
binaryTreePath(res, root, to_string(root->val));
return res;
}
void binaryTreePath(vector<string>& result ,TreeNode* node, string s)
{
if (node->left==NULL && node->right==NULL )
{
result.push_back(s);
return;
}
if (node->left) binaryTreePath(result,node->left, s +"->"+ to_string(node->left->val));
if (node->right) binaryTreePath(result,node->right, s +"->"+ to_string(node->right->val));
}
};