g******0
发帖数: 221 | 1 Given two strings: s1(length n),s2(length m).
Building the suffix tree of s1 takes O(n) time. To search s2 in the suffix
tree of s1 takes O(m). Why?
For example: s1: abcde, s2: e. The tree is shown below. Shouldn't the search
time be O(n)? 弱问，what did i miss? Maybe I should ask what is data
structure of the children of a node in a suffix tree? many thanks!
|(1:abcde)|leaf
tree:|
|(2:bcde)|leaf
|
|(3:cde)|leaf
|
|(4:de)|leaf
|
|(5:e)|leaf |
|
c*********t
发帖数: 2921 | 2 好像过去大概一个月左右的时候这里讨论过这个问题，找不到那个帖子了。
cracking the code interview (careercup)的书上说full, complete binary tree是
一回事，可是在别的地方看到的是full binary tree肯定是complete,但是complete
binary tree不一定是full.
我看到的是full binary tree,每个non-leaf node 肯定有两个children.但是complete
binary tree不是这样的。
谁能把那个帖子给弄出来？
谢谢！ |
|
i**********e
发帖数: 1145 | 3 这题主要考察重建 general tree，不是 binary tree。然后就是怎么把 general tree
用 binary tree 来表示。
还有要注意给的是 preorder 和 postorder.在 binary tree 里 preorder 和
postorder 是不可能重建树的。
不过我认为这题作为面实题，给不到你对 candidate 很有用的signal。个人意见。 |
|
|
g********r
发帖数: 89 | 5 Career Cup上看到的，虽然是两年前的老题了，大家做做？
Consider this string representation for binary trees. Each node is of the
form (lr), where l represents the left child and r represents the right
child. If l is the character 0, then there is no left child. Similarly, if r
is the character 0, then there is no right child. Otherwise, the child can
be a node of the form (lr), and the representation continues recursively.
For example: (00) is a tree that consists of one node. ((00)0) is a two-node
tree in which the r... 阅读全帖 |
|
G***G
发帖数: 16778 | 6 how to safely prune a tree near a house?
here safely means two things.
first, how to use chainsaw or pole saw correctly so that users won't get
hurt.
I heard that a famous golfer got hurt when he was using his chainsaw.
so anyone has any experience of pruning a tree with chainsaw or pole saw.
My arm is chicken arm, not strong. Can I use chainsaw or pole saw?
secondly, when you cut the branch, if wronly, the cutting may hurt your tree.
so what is the best way to prune a tree near a house?
I heard... 阅读全帖 |
|
e****r
发帖数: 51 | 7 各位“SD贪玩的朋友们”，
我们的Facebook Group终于新鲜出炉了！
暂定名为 San Diego Chinese Young Professionals Networking (SD-CYPN, 或者简称CYPN)，具体参考后面解释。
页面链接：
http://www.facebook.com/home.php?sk=group_142757055800012&ap=1
加入你已有Facebook帐号的话，点击左上角Join Group按钮即可加入。
写在建群之前，之所以称为第0次活动，是因为在此次活动中，确定了将这个想法变为实际行动的方针。
1987年，U2根据美国加州国家公园Joshua Tree产生的灵感，创作了同名专辑。从此U2走出了从前那血气方刚、尖锐激昂的摇滚乐队姿态，从而脱胎换骨地投向内敛而艺术性的表现方法。
2011年7月美国独立日长周末，我们从San Diego驱车前往摄氏40度高温的沙漠露营。期许这一次旅行，会使我告别愤青时代。
为了避开高温时间，晚上9点之后到达宿营地，借着星光搭好帐篷，匆匆入眠。夜里下了些小雨，缓解了沙漠里的高温。清晨5：30闹钟响起... 阅读全帖 |
|
s******k
发帖数: 1149 | 8 http://www.odwalla.com/plantatree/
If everyone took just two minutes to click and type we could have all 175,
000 trees planted in no time.
50 State Program
The Odwalla Plant a Tree program is available in all 50 states from May 25,
2010 through August 15, 2010 or until 175,000 trees are donated. Go to www.
odwalla.com/plantatree, enter your email address and choose the state where
you want Odwalla to plant a tree. Only one (1) click per person. All trees
will be planted in state parks in the ch |
|
W********s
发帖数: 2256 | 9 $13.25 - $22.45
http://network.yardbarker.com/college_football/article_external
Well, that didn’t take long. A website called Zazzle.com is trying to cash
in on the Toomer’s Corner tree poisonings in Auburn, Ala.
The website is selling “Free Harvey Updyke” T-shirts for prices ranging
from $13.25 to $22.45. They come in lots of different colors and you can
customize them.
The website promotes the shirts by saying, “Free Harvey Updyke, Roll Tide.”
Harvey Almorn Updyke Jr., 62, of Dadeville, Ala., ... 阅读全帖 |
|
a**y
发帖数: 6501 | 10 By Joyce Kilmer [美] 乔伊斯.基尔默
I think I shall never see
A poem lovely as a tree;
A tree whose hungry mouth is prest
Against the earth's sweet flowing breast;
A tree that looks at God all day,
And lifts her leafy arms to pray;
A tree that may in Summer wear
A nest of robins in her hair;
Upon whose bosom snow has lain,
Who intimately lives with rain.
Poems are made by fools like me,
But only God can make a tree.
译文:
我想我永不会亲睹
一首诗美丽如同一棵树;
树的饿嘴牢牢地贴住
大地甘露流动的胸脯;
终日仰望苍穹的树
高举多叶的臂膀祈福;
也许每当夏季来到
树的发间知更鸟筑巢;
雪花 |
|
j**********t
发帖数: 3480 | 11 One guy was talking about why natural Christmas tree is so much better than
artificial Christmas tree...
Artificial Christmas tree is made into a supposedly perfect mode. You become
furious if you find imperfection in artificial Christmas tree because you
feel that you get less than what you paid for... However, for natural
Christmas tree, you find the imperfection is so natural and charming.
Imperfection is the beauty of nature!!! |
|
m*c
发帖数: 427 | 12 When I was just a lad of ten, my father said to me,
Come here and learn a lesson from the lovely lemon tree.
Don’t put your faith in love, my boy, my father said to me,
I fear you’ll find that love is like the lovely lemon tree.
Lemon tree very pretty and the lemon flower is sweet
But the fruit of the poor lemon is impossible to eat.
Lemon tree very pretty and the lemon flower is sweet
But the fruit of the poor lemon is impossible to eat.
Beneath the lemon tree one day, my love and I did a lie
A |
|
mw
发帖数: 525 | 13 比较落后，现在才开始看boosted tree，看了半天也没有明白
1 Xgboost模型里面，到底有多少独立的，disconnected trees？我读介绍，我觉得只
有一个树啊，为什么我打印结果的时候确有很多独立的树?
2.每次chentq说要grow the tree, 这个tree到底是啥? 是建立一个新的tree，还是
binary split一个node，产生两个新的edges，和两个新的node
谁给介绍一下？ |
|
M********0
发帖数: 1230 | 14
1. 任何GDBT或RF都是ensemble of trees 就是很多个决策树 RF的每个树是独立的
GDBT的则是有关联性的
每个树有自己的output 最后做一个majority vote
多少个树由n_estimator或ntree这个参数决定 这个参数可以pre-define 也可以通过
early-stopping自动选取(仅限GDBT)
每个树的深度 也就是你说的binary split层数 由max_depth参数决定 你还没有弄清
楚基本概念 建议回炉重造 读一读基本的bagging和boosting概念
2. 基于1的解释 grow the tree是指一个新的tree 因为xgb是GDBT 所以每个新的tree
都是基于之前的tree修正error的 参考boosting概念 |
|
w*******y
发帖数: 60932 | 15 Lowes has the Holiday Living 7' Amber Artificial Christmas Tree for $19.50.
It is 75% clearance marked down from it's original price of 80 bucks.
You can buy it online and pick up in store.
Linly: Link:
http://www.lowes.com/pd_351484-78347-NEV70B_4294801371_42949370
Prices/Stock may vary by location...so it's probably YMMV. I tried a few
random zip codes and they were in stock.
7' Amber Artificial Christmas Tree
7' tall with a
traditi... 阅读全帖 |
|
h*********k
发帖数: 30 | 16 Once there was a tree and she loved a little boy. Everyday the boy would
come and he would gather her leaves and make them into crowns and play
king of the forest. He would climb up her trunk and swing from her branches
and eat apples. And they would play hide-and go-seek. And when he was tired,
he would sleep in her shade. And the boy loved the tree…
But time went by. The boy grew older. And the tree was often alone.
Then one day the boy came to the tree(图示小孩长成青年) and the tree said,
" Come, |
|
K********y
发帖数: 5068 | 17 Christmas Tree 就是 Christmas Tree, 什么 Holiday Tree??
穆斯林就是要利用奥八马猴晒阴，这样的卧底，去除基督教，大肆盛行穆斯林；
可惜，左臂最后就是被利用，最后被穆穆用完一脚踢开，杀害得命运；
有什么了不起的，大不了，大家离开美国就是了
左臂自作虐，不可活 |
|
e********3
发帖数: 229 | 18 请问如果在面试中面到需要用suffix tree的，该如何写好？一般不会要你当场写出来
吧。但是又没有一个特定的APT，要怎么写那代码呢？
还有一个就是longest repeated substring这题可以构造suffix tree解答，但是要用o
(n)构造的话一些隐式节点就无法显示，而最后要的节点可能就是隐式节点，请问这个
问题要怎么解决呢？关于suffix tree的我是看以下这个文章，不知道是不是我的理解
有偏差，望指教：http://www.if-yu.info/2010/10/3/suffix-tree.html#id7 |
|
b***e
发帖数: 1419 | 19 void _linkNext(Tree root) {
Tree parent = root.parent;
if (root == parent.left && parent.right) {
root.sibling = parent.right;
return;
}
Tree uncle = parent.sibling;
while (uncle && !uncle.left && !uncle.right) {
uncle = uncle.sibling;
}
if (!uncle) {
root.sibling = null;
return;
}
if (uncle.left) {
root.sibling = uncle.left;
return;
}
root.sibling = uncle.right;
}
void linkNext(Tree root) {
... 阅读全帖 |
|
b***e
发帖数: 1419 | 20 void _linkNext(Tree root) {
Tree parent = root.parent;
if (root == parent.left && parent.right) {
root.sibling = parent.right;
return;
}
Tree uncle = parent.sibling;
while (uncle && !uncle.left && !uncle.right) {
uncle = uncle.sibling;
}
if (!uncle) {
root.sibling = null;
return;
}
if (uncle.left) {
root.sibling = uncle.left;
return;
}
root.sibling = uncle.right;
}
void linkNext(Tree root) {
... 阅读全帖 |
|
f*********m
发帖数: 726 | 21 leetcode 上的Unique Binary Search Trees,算总的Binary Search Trees数目：
Given n, how many structurally unique BST's (binary search trees) that store
values 1...n?
可以用dp:
int dp[n+1];
memset(dp, 0, (n+1)*sizeof(int));
dp[0] = 1;
dp[1] = 1;
for (int i = 2; i <= n; i++) {
for (int j = 0; j < i; j++) {
dp[i] += dp[j]*dp[i-j-1];
}
}
return dp[n];
若是要算总的Trees数目，那应该是
dp[i] += 2*dp[j]*dp[i-j-1]吧？
既一个节点既可以出现在根的左边，又可以出现在右边？ |
|
s********u
发帖数: 1109 | 22 嗯我自己推了一下就发现问题在哪了。就是说还是需要标记或者"封装"的。
比如建一个tree的类，然后pop出来如果发现是tree，就分成节点和tree；如果是节点
，就直接读取。最后读到的都是节点。
但这样的话，需要再建一个base class是用tree或者节点作为构造的参数的。 |
|
f**********t
发帖数: 1001 | 23 // Consider this string representation for binary trees. Each node is of the
// form (lr), where l represents the left child and r represents the right
// child. If l is the character 0, then there is no left child. Similarly,
if r
// is the character 0, then there is no right child. Otherwise, the child
can
// be a node of the form (lr), and the representation continues recursively.
// For example: (00) is a tree that consists of one node. ((00)0) is a two-
node
// tree in which the root has a ... 阅读全帖 |
|
S**********5
发帖数: 896 | 24 面经上看到的，没什么思路，谁给说说思路和最优能写成什么样？谢谢
Given a binary tree and a leaf node, holding that leaf node and whole tree
falls down such that it is the new root of the tree. Return the modified
tree. |
|
o******h
发帖数: 1142 | 25 kd tree, segment tree, interval tree, 这些各种tree 有啥好的教材,易于面试实现
的？
求推荐
况？ |
|
s**********g
发帖数: 14942 | 26 leetcode常见题型的话
能用segment tree的题基本都有其他替代品
光说tree就有神马BIT tree啊啥的
但segment tree的确可以灵活解决不少问题
未必能提供面试时的最优solution
但能解决问题 complexity也不差
be |
|
c********m
发帖数: 571 | 27 【 以下文字转载自 gardening 讨论区 】
发信人: charmdream (美加梦), 信区: gardening
标 题: Tree removal
发信站: BBS 未名空间站 (Tue May 31 13:17:14 2011, 美东)
One tree in my backyard is dead. I checked with HD/Lowes. Seems no way to
save it or not worth to do it. I am considering to remove it.
The HD people suggest not to plant other tree in that place too.
Is there any other thing to be cautious?
What's the cost of tree removal? What kind of service included?
Thanks |
|
a*****0
发帖数: 3319 | 28 Thank you very much. We have a one-story ranch style house, so any tree
would grow above our roof ridge.
I measured and found one pine tree is only 4'5" to the house and another is
10'10" to the house.
Removing trees are expensive. I saw a post in another forum said that the
cheapest quote she got is $2000 for removing one tree. |
|
n***s
发帖数: 10056 | 29 The answer is: depends -- if side pruning makes tree severly imbalanced, you
will have risk of tree falling to the heavy side in wet and windy
conditions. It also depends on the size/type of a tree. What kind of tree(s)
do you have? |
|
p*n
发帖数: 1736 | 30 【 以下文字转载自 SanDiego 讨论区 】
发信人: psn (泼水? 嗯.), 信区: SanDiego
标 题: Joshua Tree星星爬梯小记
发信站: BBS 未名空间站 (Fri Jan 30 04:16:22 2009)
我要看冬夜的星空！
去年夏天，在Anza-Borrego沙漠，对着满天繁星，我许下了这个心愿；于是，在除夕前的那个夜晚，那个新月的前夜，我去了Joshua Tree国家公园。那里有一个星星爬梯。
出发时，天边翻滚着黑云，雨点不时打在车窗上。天气预报说Joshua Tree有百分之五十的云层覆盖，我晕！一个月前做的准备，一切就绪，然后天天看气象，天天晴空万里。可是的可是啊，临出发前一周，一切按墨菲定律发生了 —— 风云突变。我决定挑战那个该死的定律，按既定方针办。
随着逼近Joshua Tree，云居然渐渐散去，到公园时，晴空万里，一碧如洗！先找宿营地，搭好帐蓬，再去公园各角落视察，最后去爬梯。到达爬梯现场时，天已近黑。停车场里人不多，但已经有一些望远镜支了起来。其中有一架大约二十吋的Dobsonian引起了我的注意，Dobsonian边上站着两 |
|
m****s
发帖数: 7397 | 31 Robert H Goddard 的少年故事 （摘自 尾给屁颠）
He became interested in space when he read H. G. Wells' science fiction
classic The War of the Worlds when he was 16 years old. His dedication to
pursuing rocketry became fixed on October 19, 1899. The 17-year-old Goddard
climbed a cherry tree to cut off dead limbs. He was transfixed by the sky,
and his imagination grew. He later wrote:
On this day I climbed a tall cherry tree at the back of the barn . . . and
as I looked toward the fields at the east, I imagined... 阅读全帖 |
|
o**********e
发帖数: 18403 | 32 【 以下文字转载自 Seattle 讨论区 】
发信人: onetiemyshoe (onetiemyshoe), 信区: Seattle
标 题: 烙印婆罗门Tree Algorithm: 加G家的观察 (转载)
发信站: BBS 未名空间站 (Tue Oct 28 23:41:29 2014, 美东)
发信人: onetiemyshoe (onetiemyshoe), 信区: JobHunting
标 题: 烙印Tree Growing Algorithm: G家的观察
发信站: BBS 未名空间站 (Tue Oct 28 23:40:51 2014, 美东)
烙印占据狗狗的PM. 烙印有点
tree growing algorithm.
一个烙印帮着2个烙印进来，
即使同级3个烙印进了一个team。
会开始分工。 婆罗门会成为
”新星“就不会去跟人吵架了。
其他两可以干活的干活，打手的
打手。
然后很快婆罗门会往管理进军。
一旦得手，就开始吸收更多烙印，
外包给烙印，排挤别的民族和
竞争对手。
这种algorithm的结果就是到最TOP
的一般是高种姓婆罗门,被捧出来，
... 阅读全帖 |
|
o**********e
发帖数: 18403 | 33 【 以下文字转载自 Seattle 讨论区 】
发信人: onetiemyshoe (onetiemyshoe), 信区: Seattle
标 题: 烙印婆罗门Tree Algorithm: 加G家的观察 (转载)
发信站: BBS 未名空间站 (Tue Oct 28 23:41:29 2014, 美东)
发信人: onetiemyshoe (onetiemyshoe), 信区: JobHunting
标 题: 烙印Tree Growing Algorithm: G家的观察
发信站: BBS 未名空间站 (Tue Oct 28 23:40:51 2014, 美东)
烙印占据狗狗的PM. 烙印有点
tree growing algorithm.
一个烙印帮着2个烙印进来，
即使同级3个烙印进了一个team。
会开始分工。 婆罗门会成为
”新星“就不会去跟人吵架了。
其他两可以干活的干活，打手的
打手。
然后很快婆罗门会往管理进军。
一旦得手，就开始吸收更多烙印，
外包给烙印，排挤别的民族和
竞争对手。
这种algorithm的结果就是到最TOP
的一般是高种姓婆罗门,被捧出来，
... 阅读全帖 |
|
t*******r
发帖数: 2293 | 34 I'm so happy! :-) I planted the tree in spring 2010, and now have two
persimmons. :-D
My friend told me that persimmon tree require cross-pollination. I only have
one persimmon tree.
I guess mine tree doesn't require cross-pollination, or I'm so lucky! |
|
i********u
发帖数: 70 | 35 I just ordered pink magnolis tree, very fragrant japanese honeysuckle,
french lilac , jasmie and blue berry bush from hirt garden online through
amazon,
also looking for Mimosa trees(furong tree)
wish me good luch with these trees, it might take many years for them to
grow up. |
|
c********e
发帖数: 42175 | 36 【 以下文字转载自 Joke 讨论区 】
发信人: ADOMET (抗抑郁), 信区: Joke
标 题: Bubble Tree
发信站: BBS 未名空间站 (Wed Mar 2 21:25:55 2011, 美东)
Comfortable Bubble Tree
Bubble Tree is an innovative idea that came from Pierre Stephane Dumas. It
is a nice, transparent bubble where we can have all the necessary things
that can assure us some beautiful moments in the middle of nature. Inside
the bubble the circulation of air is not a problem and it is kept a constant
temperature. There are also different types of models.
http://ww... 阅读全帖 |
|
w****p
发帖数: 18 | 37 Methods for storing binary trees
Binary trees can be constructed from programming language primitives in
several ways. In a language with records and references, binary trees are
typically constructed by having a tree node structure which contains some
data and references to its left child and its right child. Sometimes it also
contains a reference to its unique parent. If a node has fewer than two
children, some of the child pointers may be set to a special null value, or
to a special sentinel |
|
H*g
发帖数: 2333 | 38 For the convergence of Bayesian Inference tree, you could go to the .log
file, check the value behind the last "Average standard deviation of split
frequencies:". Without the info of this value at least, we would not know if
we have set the generation number or the probe temperature correctly, not
saying the resulted tree is appropriate for downstream analysis.
A good and biological meaningful alignment is essential for the analysis.
Make sure of this before jumping into the actual analysis. Thi... 阅读全帖 |
|
z***e
发帖数: 5600 | 39
Yes let us assume that.
Use the binomial tree method, assume risk-neutral world,
construct the tree, then calculate price backward. The nightmare
is, when you construct the tree, the branches do not reconnect
as the size of the tree grows exponentially. One way to overcome
this problem, at least theoreticaly, is to consider the stock as
two things: a bond D that pays a known cash flow and a stock S'=S-D
that follows a stochastic process. The fact that option holder
does not get divident afte |
|
t**g
发帖数: 1164 | 40 【 以下文字转载自 JobHunting 讨论区 】
发信人: ttgg (还在苦苦思索昵称中), 信区: JobHunting
标 题: 请教一个binary tree问题
发信站: BBS 未名空间站 (Fri Feb 26 00:18:36 2010, 美东)
一个unbalanced binary tree
每个节点记录一个整数
对每个节点值
左边的child小于当前节点
右边的child大于当前节点
所以你插入1,2,3,4,5...n,会得到一个depth=n的树
可是插入6,4,8,3,5,7,9，就会得到一个well balanced tree
问题：
What is the average asymptotic depth of a simple unbalanced search tree of
integers? Use O(n) notation and provide proof |
|
w*******y
发帖数: 60932 | 41 Kinda hard to price compare these things, but prices seem reasonable enough
to me...
Lighted Pathway Trees (Set of 4) $10
Link:
http://www.bedbathandbeyond.com/product.asp?MC=1&SKU=17284410&RN=2232&
Welcome all your holiday guests with a pathway lined with pre-lit Christmas
trees. Artificial trees feature end-to-end connectors and 45 clear lights.
Outdoor use only (includes stakes). UL approved lights. Includes extra bulbs
and fuses. Each tree measures 24".
Candy Cane LED Solar-Powered Path Mark... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 43 Just found some of these trees on sale for 90% off. If you have
shipadvantage then there is free shipping, or if you're lucky there will be
availability at your local Sears (otherwise shipping is around $25). Hope
this can help someone who needs a new tree for next year.
Country Living 7.5 ft. Cashmere Mixed Pine Clear
Link:
http://www.sears.com/shc/s/p_10153_12605_07190770000P?prdNo=15&
$25.97
Country Living 7.5 ft. Wakefield Blue/Green Slim Tree Multi Lights Link:
http://www.sears.com/shc/s/... 阅读全帖 |
|
w*******y
发帖数: 60932 | 44 Family Tree Maker 2011 Deluxe:
http://www.amazon.com/Family-Tree-Maker-2011-Deluxe/dp/B0041DTN
Product Features
Software for discovering your family history and preserving it for
generations to come
Brand-new user interface; organize media files with drag-and-drop
simplicity
Storytelling tools let you build your family tree, create charts and
reports, plus incorporate photos and video
View timelines and interactive maps; 5 new report styles and 4 new fan
chart designs
Include... 阅读全帖 |
|
|
w*******y
发帖数: 60932 | 46 GE 7.5ft Just Cut Blue Noble Fir Christmas Tree with Clear Lights
Link:
http://www.sears.com/shc/s/p_10153_12605_07111043000P
Product Description
This GE decorator's Best 7.5ft. GE Just Cut Noble Fir with clear lights is
sure to enhance your holiday decor. It's out swept silhouette has a
realistic look, color and feel.
50in. base diameter
600 constant-on clear and frost white lights
1710 branch tips with 2 needle construction
Metal stand included
Assembly required
3 year warranty for lights; 5... 阅读全帖 |
|
l**********t
发帖数: 5754 | 47 【 以下文字转载自 TrustInJesus 讨论区 】
发信人: littletshirt (苹安喜乐), 信区: TrustInJesus
标 题: Family Tree
发信站: BBS 未名空间站 (Mon Jun 18 12:35:08 2012, 美东)
Family Tree of Christianity Branches.
Is this a tree of life, or tree of good and evil to you? |
|
h*********k
发帖数: 30 | 48 But the boy stayed away for a long time… and the tree was sad.
Then one day the boy came back(图示:青年已近中年)) and the tree shook
with joy and she said,
"Come, boy, climb up my trunk and swing from my branches and be happy. "
"I am too busy to climb trees", said the boy. "I want a house to keep me
warm," he said, "I want a wife and I want children, and so I need a house.
Can you give me a house? "
"I have no house," said the tree. "The forest is my house, but you may
cut |
|
p********a
发帖数: 761 | 49 A 15-foot tall Christmas tree sparked a fatal fire that tore through a 16,
000-square-foot Annapolis mansion, killing a couple and their four
grandchildren in the fast-moving flames, investigators believe.
The preliminary cause of the fire, revealed at a press conference Wednesday,
comes just two days after the final body of six total was pulled from the
debris left by the pre-dawn blaze last week.
Reported early Jan. 19, the flames leveled the sprawling two-story home to
rubble and killed Don P... 阅读全帖 |
|
a***i
发帖数: 39 | 50 撞树还能逃跑，very lucky driver
http://abclocal.go.com/kabc/story?section=news/local/los_angeles&id=7741731
UNIVERSAL CITY, Calif. (KABC) -- Part of the 101 Freeway was closed Saturday
morning after a tree fell across several lanes.
It happened on the northbound side, just before the Universal City exit
around 3 a.m.
California Highway Patrol officers said the driver of an SUV hit the 40-foot
tree, knocking it into the road. Three lanes of the freeway were closed for
more than 90 minutes as officers in... 阅读全帖 |
|
