http://blog.csdn.net/crazy1235/article/details/51474128

花樣做二叉樹的題……居然還是不會么……

?

/*** 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:void binaryTreePaths(vector<string>& result,TreeNode* root,string t) { if(!root->left&&!root->right) { result.push_back(t); return; } if(root->left) binaryTreePaths(result,root->left,t+"->"+to_string(root->left->val)); if(root->right) binaryTreePaths(result,root->right,t+"->"+to_string(root->right->val)); } vector<string> binaryTreePaths(TreeNode* root) { vector<string> result; if(root==NULL) return result; binaryTreePaths(result,root,to_string(root->val)); return result; } };

?

轉載于:https://www.cnblogs.com/sherry-yang/p/8445981.html

總結

以上是生活随笔為你收集整理的【easy】257. Binary Tree Paths 二叉树找到所有路径的全部內容，希望文章能夠幫你解決所遇到的問題。

如果覺得生活随笔網(wǎng)站內容還不錯，歡迎將生活随笔推薦給好友。