LeetCode : Binary Tree Paths

Given a binary tree, return all root-to-leaf paths.

For example, given the following binary tree:

1
/ \
2 3
\
5
All root-to-leaf paths are:

[“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:void binaryTreePaths(vector<string>&dst,TreeNode* root,string s){if(root->left==NULL&&root->right==NULL){dst.push_back(s);return ;}if(root->left)binaryTreePaths(dst,root->left,s+"->"+to_string(root->left->val));if(root->right)binaryTreePaths(dst,root->right,s+"->"+to_string(root->right->val));}vector<string> binaryTreePaths(TreeNode* root) {vector<string>ret;if(root==NULL)return ret;binaryTreePaths(ret,root,to_string(root->val));return ret;}
};

转载于:https://www.cnblogs.com/chankeh/p/6850082.html

LeetCode : Binary Tree Paths相关推荐

[LeetCode] Binary Tree Paths - 二叉树基础系列题目
目录: 1.Binary Tree Paths - 求二叉树路径 2.Same Tree - 判断二叉树相等 3.Symmetric Tree - 判断二叉树对称镜像 Binary Tree Path ...
[LeetCode] Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1/ ...
LeetCode刷题记录14——257. Binary Tree Paths（easy）
LeetCode刷题记录14--257. Binary Tree Paths(easy) 目录前言题目语言思路源码后记前言数据结构感觉理论简单,实践起来很困难. 题目给定一个二叉树, ...
Binary Tree Paths leetcode
Binary Tree Paths Given a binary tree, return all root-to-leaf paths. For example, given the followi ...
[LeetCode] Binary Tree Level Order Traversal 二叉树层次遍历(DFS | BFS)
目录: 1.Binary Tree Level Order Traversal - 二叉树层次遍历 BFS 2.Binary Tree Level Order Traversal II - 二叉树层次 ...
CF750G New Year and Binary Tree Paths（数位dp二进制+数学）
CF750G New Year and Binary Tree Paths description solution code description 题目链接一颗无穷个节点的完全二叉树. 求有多少 ...
Binary Tree Paths
Binary Tree Paths Given a binary tree, return all root-to-leaf paths. For example, given the followi ...
LeetCode OJ -- Binary Tree Paths
http://blog.ubooksapp.com/ 标签(空格分隔): LeetCode OJ BinaryTree Given a binary tree, return all root-to- ...
LeetCode 257. Binary Tree Paths （二叉树路径）
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1/ ...

LeetCode : Binary Tree Paths

LeetCode : Binary Tree Paths相关推荐

最新文章

热门文章