[LeetCode] Path Sum IV 二叉树的路径和之四
If the depth of a tree is smaller than 5, then this tree can be represented by a list of three-di ...
原文：[LeetCode] 112. Path Sum 二叉树的路径和
Given 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. Note:A leaf is a node with no children. Example: G ...
2014-10-20 13:08 4 12704 推荐指数：
相关推荐
二叉树系列 - 二叉树里的最长路径 例 [LeetCode] Binary Tree Maximum Path Sum
题目： Binary Tree Maximum Path Sum Given a binary tree, find the maximum path sum. The path may start and end at any node in the tree. For example ...
[LeetCode] 113. Path Sum II 二叉树路径之和之二
and sum = 22, return 这道二叉树路径之和在之前那道题 Path Sum 的 ...
[LeetCode] 124. Binary Tree Maximum Path Sum 求二叉树的最大路径和
Given a non-empty binary tree, find the maximum path sum. For this problem, a path is defined as any sequence of nodes from some ...
[LeetCode] 437. Path Sum III 二叉树的路径和之三
You are given a binary tree in which each node contains an integer value. Find the number of paths that sum to a given value. The path does ...
[LeetCode 124] - 二叉树最大路径和(Binary Tree Maximum Path Sum)
问题 给出一个二叉树，找到其中的最大路径和。 路径可以从树中任意一个节点开始和结束。 例如： 给出如下二叉树， 1 / \ 2 3 返回6。 初始思路 为了简化分析，我们先假设二叉树中所有节点的值都是正数。通过观察可以发现，一棵 ...
[LeetCode] Binary Tree Paths 二叉树路径
们一个二叉树，让我们返回所有根到叶节点的路径，跟之前那道Path Sum II很类似，比那道稍微简单一些， ...
二叉树系列 - 二叉树的深度，例 [LeetCode]
二叉树的深度的概念最值得注意的地方，在于 到"叶子"节点的距离。 一般来说，如果直接说“深度”，都是指最大深度，即最远叶子的距离。 这里放两道例题，最小深度和最大深度。 1. 二叉树的最小深度 Given a binary tree, find its minimum depth. ...