![](https://img-blog.csdnimg.cn/20201014180756754.png?x-oss-process=image/resize,m_fixed,h_64,w_64)
二叉树
文章平均质量分 82
yiayia070614
在阿里做苹果业务
展开
-
LeetCode 112&113 --Path Sum I & II;
Path Sum IGiven a binary tree and a sum, determine if the tree has a root-to-leaf path such that adding up all the values along the path equals the given sum. For example:Given the below binary tr原创 2016-09-11 13:37:04 · 188 阅读 · 0 评论 -
Leetcode 257 -- Binary Tree Paths
Given a binary tree, return all root-to-leaf paths. For example, given the following binary tree: 1 / \2 3 \ 5All root-to-leaf paths are: ["1->2->5", "1->3"] 解法:原创 2016-09-11 14:52:55 · 165 阅读 · 0 评论