|
|
w*******y
发帖数: 60932 | 3 Ignore the reviews....I have this tree and at 6.5 tall its very full and
looks great. For this price its even better!
People think they are getting a 9 ft pine and complain when they realize the
actual dimensions on the box were correct!!!
6.5 Foot Pre-Lit Tree (Indoor/Outdoor)
A simple solution for completing your holiday decor, this indoor/outdoor
tree features two strands of dazzling twinkle lights that will light up
cheerful nights. Its bendible branches make it easy to deconstruct and put... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 5 Ok its that time of the year and as they do EVERY YEAR the Arbor Day
Foundation is offering a Membership plan for $10 that comes with "10 FREE
TREES"
please note this is more about supporting the Arbor Day Foundation as the "
Trees" are no more then Saplings, that if you do your part will grow and be
Very Rewarding
also this is Regional i have done this before and when 8 out of the 10
SURVIVED i have to find friends to give some to as i really had no room for
even 5 of then
GET 10 TREES FOR SPR... 阅读全帖 |
|
w*******y
发帖数: 60932 | 6 For those interested in plants or bonsai, Eastern Leaf has a Juniper Bonsai
Tree for 50% off it's regular price of $20. $10.
50% off $20 = $10 + shipping (depends on ship to location)
Pretty good price if you want to dabble in bonsai. Doesn't require a coupon
code. Deal says while supplies last.
Link:
http://www.easternleaf.com/ProductDetails.asp?ProductCode=80192
Product description from store (Eastern Leaf):
Juniper bonsai tree, aged 2-3 years old, measures between 5" and 6.5" tall
from the b... 阅读全帖 |
|
w*******y
发帖数: 60932 | 7 Instant Roof Tree Stand Umbrella 57" (Oakbrush-color) $6.62 free shipping
with Prime (FSSS) from AmazonIncludes 57-Inch overall width
Mounts to any tree
Storage sack included
Oak Brush camouflage
Allen Company Instant Roof Tree Stand Umbrella (Oakbrush-color):
http://www.amazon.com/Allen-Company-Instant-Umbrella-Oakbrush/d
$6.62
|
|
w*******y
发帖数: 60932 | 8 First off, this is my first deal submission, so if I hose it up then my
apologies.
Found this artificial Christmas tree on sale at Kohls website. They are
running a free shipping promo, and I used coupon code EBTSFALL to get
another 15% off. Final price was $108.06. Most similiar 7-foot trees I
found were closer to $200 or more.
Link:
http://www.kohls.com/kohlsStore/living_room/holidayhomedecor/de Nicholas Square 7ft Douglas Fir PreLit Christmas Tree.jsp
I also attached my checkout summary to... 阅读全帖 |
|
w*******y
发帖数: 60932 | 9 Through 12/8 only, add a Set of 2 Celebrations 4' Porch Trees to your cart
and the price drops to $14.99. Ship it to your local Ace store for free.
This set is available with colored lights or clear lights. These trees are
19" in diameter and feature 117 tips with 50 lights. Sales tax is charged in
most states.
BTW: These are a set of 2, so if you want the two trees add 1 item to your
cart. Price drops in cart.
Linky:
http://www.acehardware.com/search/index.jsp?kwCatId=&kw=celebra 4ft set of 2&o... 阅读全帖 |
|
w*******y
发帖数: 60932 | 10 Just found the "7ft Spiral Christmas Tree with 300 Lights, Clear" at sears
website for 11.97 down from $49.99
Link:
http://www.sears.com/shc/s/p_10153_12605_07194640000P?prdNo=17&
This is the tree that is simply the lights without greenery. The
multicolored tree is twice as much
From sears website
Product Description
Plastic collapsible construction for easy set up. Plastic stand included for
indoor use. Metal ground stake for outdoor use. With 300 clear lights.
Durable, pre-wired PP frame. Con... 阅读全帖 |
|
g***y
发帖数: 2942 | 11 一直不喜欢The Giving Tree这本书，觉得太sad了，阅读理解很差的妈很不明白为啥要
给娃看这样的书。Anyway，那天娃又钦点要念这本。读完了，我还是觉得很sad，掩卷
唏嘘：such a sad story，转头看娃，竟然眼圈都微红了，一脸受伤的样子，想起念书
过程中他也不像平时那么话痨，只是很安静的问了几个why，当妈的心里一动，难道他
看懂了？就开问了，
妈：Are you ok?
儿子： I feel sad...
妈：Why are you sad?
儿子：Because it's a sad story...
妈：Why？
儿子：I feel sad for the tree!
妈（心中暗喜）接着问：Why do you feel sad for the tree?
儿子： Because...because I want to eat the apples!! |
|
H****s
发帖数: 1130 | 12 消毒高手：茶樹精油！
對精油與芳香療法領域稍有涉獵的人，都會知道茶樹精油的神奇，國際知名芳療專家Va
lerie Ann Worwood在其「芳香療法配方寶典」中將茶樹列入「十種用途最多，最有用的
精油」，另一位芳療大師Daniele Ryman也認為茶樹是「所知最佳的急救工具」。在澳洲
，茶樹已經成為重要的經濟作物之一，並全力開發各種相關用品。在現在這種恍如暗黑
世紀、惡疾猖獗的混亂中，知道有茶樹這種自然餽寶，的確讓人安心不少。
茶樹檔案
茶樹的英文古字為Ti Tree，後因音近與混淆，也有「Tea Tree」的俗稱。澳洲原住民在
生病或身體保健時會煮茶樹的樹葉來喝，此事經探險家庫克船長發現，也試試這種「澳
洲茶」的效果，並將心得帶回英國研究，這是茶樹的第一次科學發現。但是千萬不要誤
會，茶樹不是休閒飲料，而是作為藥用，某些芳療師或大眾不明究理，就把Tea Tree當
作飲料了。
茶樹是桃金娘科植物，在植物分類上屬於「白千層」的一種，學名為「亙葉白千層」，
原產地為澳洲。直到第二次世界大戰前，茶樹都是重要的消毒殺菌來源，後因抗生素的
發明，人們喜歡像抗生素這種立即有效的消炎殺菌配方， |
|
h*********k
发帖数: 30 | 13 And after a long time the boy came back again.(图示: 瘦骨嶙峋步履蹒跚，
面部皮肤松皱不堪，几乎全口无牙可怜兮兮的老人 :( )
"I am sorry, Boy, " said the tree, " but I have nothing left to give
you--- My apples are gone"
"MY teeth are too weak for apples, " said the boy.
"MY branches are gone,"said the tree, "You cannot climb---- "
"I am too tired to climb," said the boy.
"I am sorry," sighed the tree. "I wish that I could give you something … but
I have nothing left. I am just an old stump. I am sorry.... ".
"I don't need |
|
l*****7
发帖数: 8463 | 14 It is not a family tree!!!
Do you know how to draw a family tree??? |
|
s*********8
发帖数: 901 | 15 RapEW DELHI (Thomson Reuters Foundation) - Indian police have arrested one
man and are looking for four other suspects after two teenage girls were
gang-raped and then hanged from a tree in a village in the northern state of
Uttar Pradesh, police said on Thursday.
The two cousins, who were from a low-caste Dalit community and aged 14 and
15, went missing from their village home in Uttar Pradesh's Budaun district
when they went out to go to the toilet on Tuesday evening.
The following morning, vi... 阅读全帖 |
|
V******e
发帖数: 3085 | 16 老印TREE 了半天 NEW BEE,都是在职场上忽悠上司以及客户，同时打压异己包括老中，
给自己创造了利益。
国内三省人民 TREE NEW BEE一般是在酒桌上，上至国家元首都敢称兄道弟，满嘴跑航
天火箭。 |
|
h******k
发帖数: 15372 | 17 快过年了，公司里要弄圣诞树，不过秘书发的邮件里说是“Holiday Tree”。Holiday
需要弄个树，这是什么传统？政治真正确啊。 |
|
k*******g
发帖数: 7321 | 18 再过两年，改名木海木德 tree
Holiday |
|
C****s
发帖数: 249 | 19 【 以下文字转载自 Parenting 讨论区 】
发信人: Cadmus (东方), 信区: Parenting
标 题: Christmas Tree, 这个价钱好不好?
发信站: BBS 未名空间站 (Sun Dec 26 23:55:01 2010, 美东)
娃慢慢大了，想趁节后囤个圣诞树明年用.今天有出去买圣诞树，节日彩灯，装饰品的
jm吗?
7.5ft, 好像宽52cm ，叫virgin Chirstmas tree，好像是1500个灯？还有一个数字说
是可以有多少枝挂东西，也不记得了. 50% off, sale for $125，这个价钱算不算丢
？可以买吗？
7ft的，看着宽度大约小一些？ 60% off sale $79.99. (不过好像觉得这两棵树都比在
朋友家看见的要瘦一些。)
请教一下，想买丰满一些的圣诞树，多少钱可以囤了？还有Costco有卖圣诞树吗？什么
样的尺寸，多少钱呢? |
|
l******o
发帖数: 71 | 20 This is not a small mistake. It's a big one!!
Landscaping can be just a small thing if you are talking about planting
some flowers or bushes in your garden.
However, my trees are lined up very nicely and 3 stories tall.
It has been growing for more than 30 years (replace them is not option). We
did't even realize much of neigbour's existence in their yard. Now we are
almost face to face. Those trees are one of the major reason we bought the
house. BTW, they are evergreens if you don't that
... 阅读全帖 |
|
S*******e
发帖数: 186 | 21 Recently, one huge oak tree fell down. I have cut the tree into 7 short
pieces of woods. Height: 2 - 2.5 ft, diamter: 1.5-2 ft
I try to sell for $35 for total wood above.
if interested, pls call 781-608-1632 |
|
j*****j
发帖数: 115 | 22 没有parent的tree，空间复杂度是O(h), h是max height of the tree |
|
C**********n
发帖数: 100 | 23 是吗？
那如果我看到书上一个现成的binary search tree,
请问该按什么顺序输入这些数字才能使得所生成的binary search tree跟书上的那个一
样呢? |
|
g*******y
发帖数: 1930 | 24 如果给你的是node的序列，i.e, vector pre,post;
pre + post 一样的也能recursive的build tree, |
|
H*M
发帖数: 1268 | 25 1. given a binary tree ,find the largest sub-tree which is a BST...(largest
mea
ns subtree having largest no of nodes in it)
我的理解是subtree就是说是一个子树,比如要到原来树的leaf,而不能把原来树的inter
nal nodes做leaf.也就是不能中间截一块,是这样的吗?
有什么好方法.我写的特别繁琐.if else 很多,用recursion.
2. 第二题说,design n stacks in an array of N. 这个我想愿意肯定不是让一个
stack分派固定的.感觉是要综合调配的,比如,如果array还有空,就不能说某个stack不
能加入了.我
想法是keep一个free list,,每个stack元素都要有个Next的指针,指向下个元素,stack
push的时候,就从freelist里面取.这样stack的元素就不连续了.
有什么其它的好办法么? |
|
g*****u
发帖数: 298 | 26 这说的我还好受点。。。
我在career cup上见到有人说他面试时，interviewer让他当场写出一个suffix tree，
我倍感打击。。。让我写个trie可能还行，suffix tree麻烦的多。。。 |
|
h********0
发帖数: 440 | 27 前面看到有一个贴子是判断isBinaryTree的问题
http://www.mitbbs.com/article_t/JobHunting/31521831.html
讨论结果主要有两个方向
(1) inOrderScan, 看看是不是结果排序了
(2) 对每一个节点判断是不是
node->val >＝ minValue(right tree)
node->val < maxValue(left tree)
对于第一种思路，我有一个问题，如果BST有重复值
BST assumes
left child <= current node < right child
但是如果我们只是看结果是不是排序，这个“＝”就不知道在什么地方了
有可能是 for some node: left child < current node <=right child.
那即使结果是排序的，其实也是有问题。
我自己想可以用一些方法来检查，但是都很ugly. 所以不知道有没有什么更好的想法。
对于第二种思路，在上一个贴子里有提供一个链接
http://cslibrary.stanford |
|
x***y
发帖数: 633 | 28 Actually, a node is always a lower bound for the right tree(<), and upper
bound for the left tree (>=), we can modify that guy program:
if (node->data=data>max) return(false);
// otherwise check the subtrees recursively,
// tightening the min or max constraint
return
isBSTUtil(node->left, min, node->data) &&
isBSTUtil(node->right, node->data, max) |
|
K******g
发帖数: 1870 | 29 谁能指点一下，balanced search tree的复习要点是什么，那些什么black-red tree需
要了解细节吗？ |
|
c**********e
发帖数: 2007 | 30 A binary tree is full if all of its vertices have either zero or two
children. Let B_n denote the number of full binary trees with n
vertices. What is B_n? |
|
b******n
发帖数: 823 | 31 (n-1)/2个inner node，
应该就是算(n-1)/2个node的tree有多少不同形态？因为对应一个形态，把leaf补满即是对应full binary tree了 |
|
C*Y
发帖数: 736 | 32 Interview questions for front-end web developer.
1. Given a node of a non-binary tree, find all nodes on the same level. Choose any
language and data structure you prefer to implement this.
2. Given a node of a DOM tree, find all nodes on the same level. Use javascript and jquery library to implement this, write as less code as possible. |
|
K******g
发帖数: 1870 | 33 写了个关于binary tree的代码，想测试一下。但是想来想去，不知道怎么随机生成一
棵binary tree，谁有什么好的建议吗？多谢。 |
|
r****o
发帖数: 1950 | 34 我对trie一直不是很懂，
如果要在n个单词中查某个单词(长度为m个字母)的话，
为什么不能把这n个单词组成一个binary search tree呢？这样平均复杂度是O(lgn)。
而用trie查的话复杂度是O(m)。
这样lgn
这个问题可能很弱，欢迎拍砖。 |
|
I**A
发帖数: 2345 | 35 Given the pre-order and in-order traversing result of a binary tree, write a
function to rebuild the tree
ideas? |
|
t******e
发帖数: 1293 | 36 linked list可以看作是只有右孩子的binary tree
有balance的算法，比如DSW，可以把它变为balanced binary tree |
|
y*********e
发帖数: 518 | 37
是BST嘛？假设是BST。
6
/ \
4 8
/ \ / \
1 5 7 9
inorder是 1 4 5 6 7 8 9
levelorder是 6 4 8 1 5 7 9
6
/ \
4 8
/ / \
1 7 9
inorder是 1 4 6 7 8 9
levelorder是 6 4 8 1 7 9
注意到，在 levelorder 中， INDEX (parent) < INDEX (node)。
解法思路如下：
1、取 levelorder 的第一个，作为 root。在 inorder 里面，小于 root 的值，是为
left sub tree。在 inorder 里面，大于root 的值，是为 right sub tree。
2、在 levelorder 里面找寻第一个值 n，使得 n < root && INDEX(n) >
INDEX(root) |
|
d*****t
发帖数: 41 | 38 我这里假设你说的是Binary tree。其它的TREE无非就是子节点多一些，要比较的子
path多一些。
vector* longestpath(node* root)
{
vector* path;
if(root==NULL)
{
path = new vector;
}
else
{
vector* left = longestpath(root->left);
vector* right = longestpath(root->right);
path = left->size()>right->size()?left:right;
path->push_back(root);
}
return path;
}
然后根据要求加个wrapper function就行了 |
|
l********y
发帖数: 1327 | 39 BST的left child能比parent大吗?比如这种情况
7
6 10
5 8 9 12
对于每一个节点来说依然是left child < parent < right child,但是更深层次的节点
8却比上层节点7要大.这样的tree还能说是Binary search tree吗? |
|
c***2
发帖数: 838 | 40 This is a lookup problem.
To use prefix tree for this: build the tree with 0-9, at the end node, store
person's name.
(This is similar to routing table lookup.)
Can also be done with hash mapping. |
|
v*******7
发帖数: 187 | 41
tree,
child
I am wondering whether such solution exists. Traversal of a tree without
recursion
can be done by either Queue-based or Stack-based. But if the space required
is no
more than constant, it means that the space allocated to Queue or Stack is
constant.
But I have no idea on how to deal with it by using Q/S with constant space
forever. |
|
l*****a
发帖数: 559 | 42 Your depth of the tree is non-constant. If there is not parent pointer,
no extra space to store the path from root to current node, how can you go
back once you are in the leaf.
tree,
child |
|
s**x
发帖数: 7506 | 43 how to find all the overlapped intervals via augmented interval tree?
google shows a lot weird interval tree implementations not the one mentioned
in CLRS book.
thx! |
|
s**x
发帖数: 7506 | 44 14.3-4
given an interval tree T and interval i, describe how all intervals in T
that overlap i can be listed in O(min(n, klogn)) time, where k is the number
of intervals in the output list. (optional: find a solution that does not
modify the tree)
14.3-7
VLSI databases commonly represent an intergrated circuit as a list of
rectangles, assume that each rectangle is rectilinearly oriented(side
parallel to the x- and y-axis), so that a representation of a rectangle
consists of its minimum and maxim... 阅读全帖 |
|
F**r
发帖数: 84 | 45 14.3-4 is straightforward, directly utilize the properties of interval tree.
14.3-7 straightforward too, apply interval tree in 2-D respectively.
number
time |
|
i**********e
发帖数: 1145 | 46 Trie 的插入和查找是 O(N), N = 字符串的长度。
Trie 是 prefix tree 的简称。
网上有很多关于 trie 的教程，相信你可以很快就掌握。
至于 suffix tree 就比较复杂，面试一般都不太问。至少不会变态到叫你写代码。 |
|
k*j
发帖数: 153 | 47 曾经看过一个题。说用到interval tree,有人能帮忙说一下吗？原帖如下。
1) 一个range的序列（链表或数组），如[1,3], [2,6], [8,10]，[15,18]
写程序合并有重叠的range，比如上面的序列合并为[1,6], [8,10], [15,18]
如果这个序列不是静态的，而是一个数据流，如何 处理？
=> 后来听说了interval tree，不过还是不太清楚具体如何解决，
有大牛能详细说说么？ |
|
P**********c
发帖数: 3417 | 48 这个有很多算法，但是大部分都是assume 这两个node都在tree里，是么？
比如最简单的BST, 如果发现当前node在要找的两个node之间，就返回当前node, 但是
如果要找的两个node根本不在tree里，其实应该返回NULL? |
|
d***d
发帖数: 99 | 49 一道大公司诡异的complete binary tree max sum of 2 nodes 题
当场 40min white board 给出了O(N2) 的解法，对方表示赞许，但是没时间optimize
了。直觉告诉我应该有NlogN的解法。大牛指点下。
具体如下：
given one complete binary tree, with positive and identical values in all
nodes.
Find 2 nodes, such that:
sum of their path nodes to root (identical nodes will count only once) are maximum. |
|
w******u
发帖数: 219 | 50 比如huffman编码的那个查找树，就是full binary tree而不是complete binary tree. |
|
