码迷,mamicode.com
首页 >  
搜索关键字:ternary search tree    ( 28833个结果
【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,#,#,15,7}, ...
分类:其他好文   时间:2014-06-15 15:17:43    阅读次数:192
LeetCode:Sum Root to Leaf Numbers
Given a binary tree containing digits from 0-9 only, each root-to-leaf path could represent a number. An example is the root-to-leaf path 1->2->3 which represents the number 123. F...
分类:其他好文   时间:2014-06-15 14:51:02    阅读次数:167
【Leetcode】Binary Tree Level Order Traversal
Given a binary tree, return the level order traversal of its nodes' values. (ie, from left to right, level by level). For example: Given binary tree {3,9,20,#,#,15,7}, 3 / 9 20 ...
分类:其他好文   时间:2014-06-15 13:26:54    阅读次数:200
leetcode - Same Tree
题目:Same TreeGiven two binary trees, write a function to check if they are equal or not.Two binary trees are considered equal if they are structurally ...
分类:其他好文   时间:2014-06-15 00:53:09    阅读次数:314
<Linux下存储分离>
服务端:首先拿出一块分区/dev/sda5# yum search target# yum install scsi-target-utils.x86_64 -y //服务端的包# vim /etc/tgt/targets.conf //编辑服务端的配置//共享出这块分区的名字为redhat:...
分类:系统相关   时间:2014-06-14 21:04:16    阅读次数:332
[Leetcode] Binary Tree Maximum Path Sum
Question:Given a binary tree, find the maximum path sum.The path may start and end at any node in the tree.For example:Given the below binary tree, .....
分类:其他好文   时间:2014-06-14 20:59:07    阅读次数:188
Leetcode:Binary Tree Zigzag Level Order Traversal
Description:Given a binary tree, return thezigzag level ordertraversal of its nodes' values. (ie, from left to right, then right to left for the next ...
分类:其他好文   时间:2014-06-14 18:41:40    阅读次数:265
[LeetCode] Flatten Binary Tree to Linked List
1 迭代,重要关系 p->right = s.top(); 1 class flat{ 2 public: 3 void flatten(TreeNode* root) { 4 if (root == NULL) return; 5 ...
分类:其他好文   时间:2014-06-14 16:50:41    阅读次数:172
leetcode -day29 Binary Tree Inorder Traversal & Restore IP Addresses
1、 ?? Binary Tree Inorder Traversal Given a binary tree, return the inorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 2 / 3 return ...
分类:其他好文   时间:2014-06-14 14:11:27    阅读次数:315
[LeetCode] Search in Rotated Sorted Array II [36]
题目 Follow up for "Search in Rotated Sorted Array": What if duplicates are allowed? Would this affect the run-time complexity? How and why? Write a function to determine if a given target is in the array. 原题链接(点我) 解题思路 这题和Search in Rotated Sorted Array问题类似,...
分类:其他好文   时间:2014-06-14 12:44:18    阅读次数:266
© 2014 mamicode.com 版权所有  联系我们:gaon5@hotmail.com
迷上了代码!