https://leetcode-cn.com/problems/binary-tree-paths/description/
LeetCode 257. 二叉树的所有路径
给定一个二叉树,返回所有从根节点到叶子节点的路径。
说明: 叶子节点是指没有子节点的节点。
示例:
输入: 1 / \ 2 3 \ 5 输出: ["1->2->5", "1->3"] 解释: 所有根节点到叶子节点的路径为: 1->2->5, 1->3
方法1:递归方式(DFS)记录搜索路径
/**
* 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>
vector<string>vc;
if(root==NULL){
return vc;
}
DFS(root,vc,to_string(root->val));
return vc;
}
void DFS(TreeNode* root,vector<string> &vc,string subPath){
//叶子节点
if(root->left==NULL&&root->right==NULL){
vc.push_back(subPath);
return;
}
//非叶子节点
//如果左孩子节点不空
if(root->left!=NULL){
DFS(root->left,vc,subPath+"->"+to_string(root->left->val));
}
//如果右孩子节点不空
if(root->right!=NULL){
DFS(root->right,vc,subPath+"->"+to_string(root->right->val));
}
}
};
方法2:也是递归,另一种写法,循环+递归方式记录。
/**
* 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>vc;
//两个出口
if(root==NULL){
return vc;
}
if(root->left==NULL&&root->right==NULL){
vc.push_back(to_string(root->val));
return vc;
}
vector<string> leftS=binaryTreePaths(root->left);//get到左子树的路径
for(int i=0;i<leftS.size();i++){
vc.push_back(to_string(root->val)+"->"+leftS[i]);
}
vector<string> rightS=binaryTreePaths(root->right);//get右子树的路径
for(int i=0;i<rightS.size();i++){
vc.push_back(to_string(root->val)+"->"+rightS[i]);
}
return vc;
}
};