问题描述:给一棵二叉树,找出从根节点到叶子节点的所有路径。
样例:
给出下面这棵二叉树:
1
/ \
2 3
\
5
所有根到叶子的路径为:
[
"1->2->5",
"1->3"
]
实现思路:
前序遍历二叉树将从根节点到叶子节点的路径都存放到向量中去。
实现代码:
* 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> Paths;
if(root==NULL) return Paths;
def(root,Paths,to_string(root->val));
return Paths;
}
void def(TreeNode *root,vector<string>&str,string strPaths){
if(root->left==NULL&&root->right==NULL){
str.push_back(strPaths);
return;
}
if(root->left!=NULL)
def(root->left,str,strPaths+"->"+to_string(root->left->val));
if(root->right!=NULL)
def(root->right,str,strPaths+"->"+to_string(root->right->val));
}
};
做题感想:
这个题在课件上的方法是借助栈来完成,但是问了好几个都没这么做。。无奈自己能力不够,想那么写可是写不出来啊。然后看别人的,学到了一点吧:在库文件string中,to_string(int value)是把一个整数转换为字符串;两个字符串使用“+”连接,是字符串的无空格连接。
* 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> Paths;
if(root==NULL) return Paths;
def(root,Paths,to_string(root->val));
return Paths;
}
void def(TreeNode *root,vector<string>&str,string strPaths){
if(root->left==NULL&&root->right==NULL){
str.push_back(strPaths);
return;
}
if(root->left!=NULL)
def(root->left,str,strPaths+"->"+to_string(root->left->val));
if(root->right!=NULL)
def(root->right,str,strPaths+"->"+to_string(root->right->val));
}
};