码迷,mamicode.com
首页 >  
搜索关键字:leaf    ( 924个结果
[Leetcode] Binary Tree Level Order Traversal II
Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa...
分类:其他好文   时间:2014-11-02 07:04:55    阅读次数:202
leetcode 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.Fo...
分类:其他好文   时间:2014-10-28 07:02:27    阅读次数:171
[leetcode]Binary Tree Level Order Traversal II
问题描述: Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,...
分类:其他好文   时间:2014-10-27 21:21:00    阅读次数:190
[Leetcode][JAVA] Sum Root to Leaf Numbers
Given a binary tree containing digits from0-9only, each root-to-leaf path could represent a number.An example is the root-to-leaf path1->2->3which rep...
分类:编程语言   时间:2014-10-27 08:10:18    阅读次数:196
[leetcode]Path Sum II
问题描述: Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum. For example: Given the below binary tree and sum = 22, 5 /...
分类:其他好文   时间:2014-10-26 14:24:00    阅读次数:224
[leetcode] 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. For example: Given the below binary tree...
分类:其他好文   时间:2014-10-26 13:11:29    阅读次数:177
Binary Tree Level Order Traversal II 二叉树层序遍历之二
Given a binary tree, return thebottom-up level ordertraversal of its nodes' values. (ie, from left to right, level by level from leaf to root).For exa...
分类:其他好文   时间:2014-10-26 06:47:17    阅读次数:187
【LeetCode】 Maximum Depth of Binary Tree
题目 Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node....
分类:其他好文   时间:2014-10-25 18:50:01    阅读次数:137
LeetCode:Maximum Depth of Binary Tree
题目描述: Given a binary tree, find its maximum depth. The maximum depth is the number of nodes along the longest path from the root node down to the farthest leaf node. 解题思路:直接DFS。 代码: /**...
分类:其他好文   时间:2014-10-24 13:04:21    阅读次数:147
Path Sum II 二叉树路径之和之二
Given a binary tree and a sum, find all root-to-leaf paths where each path's sum equals the given sum.For example:Given the below binary tree andsum =...
分类:其他好文   时间:2014-10-22 07:36:22    阅读次数:218
924条   上一页 1 ... 76 77 78 79 80 ... 93 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!