leetcode 257 Binary Tree Paths

最新推荐文章于 2024-12-29 21:55:03 发布

原创最新推荐文章于 2024-12-29 21:55:03 发布 · 296 阅读

0 ·

CC 4.0 BY-SA版权

Leetcode 专栏收录该内容

127 篇文章

订阅专栏

本文介绍了一种用于查找二叉树中所有从根节点到叶子节点路径的算法实现。通过递归方式遍历二叉树，将路径信息拼接并存储为字符串形式。最终返回所有找到的有效路径。

摘要生成于 C知道，由 DeepSeek-R1 满血版支持，前往体验 >

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.

Subscribe to see which companies asked this question

class Solution {
public:
	void findPath(vector<string> &vec, TreeNode *node, string path) {
		if(node==NULL) return;
		if(node!=NULL && node->left==NULL && node->right==NULL) {
			path += to_string(node->val);
			vec.push_back(path);
			return ;
		}

		path += to_string(node->val);
		path += "->";

		findPath(vec, node->left, path);
		findPath(vec, node->right, path);
	}
	vector<string> binaryTreePaths(TreeNode *root) {
		vector<string> vec;
		findPath(vec, root, "");
		return vec;
	}
}