码迷,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-10-20 23:17:30    阅读次数:261
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-20 22:58:44    阅读次数:305
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-20 14:47:59    阅读次数:168
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-20 11:21:40    阅读次数:184
[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-16 18:00:42    阅读次数:245
[leetcode] path sum @ Python [recursion]
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-13 03:11:58    阅读次数:257
SQL反模式学习笔记3 单纯的树
2014-10-1108:59:48 在树形结构中,实例被称为节点。每个节点都有多个子节点与一个父节点。 最上层的节点叫做根(root)节点,它没有父节点。 最底层的没有子节点的节点叫做叶(leaf)。 中间的节点简单地称为非叶节点(nonleaf)。目标:分成存储于查询,比...
分类:数据库   时间:2014-10-11 12:55:45    阅读次数:176
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. /** * Definition for binary tree ...
分类:其他好文   时间:2014-10-06 16:08:40    阅读次数:181
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 and sum ...
分类:其他好文   时间:2014-10-06 01:23:59    阅读次数:228
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,#,#,15,7}, ...
分类:其他好文   时间:2014-10-05 23:07:59    阅读次数:214
924条   上一页 1 ... 77 78 79 80 81 ... 93 下一页
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!