作者sboomer (鸭子)
看板CSSE
标题[问题] 资料结构中的红黑树问题
时间Wed Feb 18 23:14:16 2009
老师讲完AVL数就没了，
做考古题发现考了红黑树问题。
不知各位前辈辈可否解惑
For red-black tree
a.if a black element has only one child,that child must be a red leaf.why?
b.if a red element has any children,it must have two children and
they must be black why
--
※ 发信站: 批踢踢实业坊(ptt.cc)
◆ From: 218.166.59.5
1F：推 LPH66:你可以去网路上找红黑树的说明 中文维基上的不错完整 02/19 04:53
2F：推 arpin:其实懂 2-4 tree 就可以啦。这两个是一样的东西。 02/20 00:33
3F：→ dynamicy:个人觉得你意义应该不是很懂...懂定义这些玩提不难 02/20 00:50