LeetCode 257:Binary Tree Paths

最新推荐文章于 2021-04-21 11:29:58 发布

原创最新推荐文章于 2021-04-21 11:29:58 发布 · 2.1k 阅读

0 ·

CC 4.0 BY-SA版权

C++ 同时被 3 个专栏收录

133 篇文章

订阅专栏

DataStructure&Algorithms

131 篇文章

订阅专栏

LeetCode算法分析

128 篇文章

订阅专栏

本文介绍了一种简单的方法来遍历给定的二叉树，并收集所有从根节点到叶子节点的路径。通过递归地访问每个节点并记录路径，最终汇总得到所有可能的路径。

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

For example, given the following binary tree:

All root-to-leaf paths are:

["1->2->5", "1->3"]

Credits:

Special thanks to @jianchao.li.fighter for adding this problem and creating all test cases.

//简单的二叉树遍历，遍历的过程中记录之前的路径，一旦遍历到叶子节点便将该路径加入结果中。
class Solution {
public:
	vector<string> binaryTreePaths(TreeNode* root) {
		vector<string> res;
		if (root==NULL)   return res;
		binaryTreePaths(res, root, to_string(root->val));
		return res;
	}

	void binaryTreePaths(vector<string>& result, TreeNode* node, string s) {
		if (node->left==NULL && node->right==NULL)
		{
			result.push_back(s);
			return;
		}
		if (node->left)     binaryTreePaths(result, node->left, s + "->" + to_string(node->left->val));
		if (node->right)    binaryTreePaths(result, node->right, s + "->" + to_string(node->right->val));
	}
};