作者sboomer (鸭子)
看板Programming
标题[问题] 资料结构中的红黑树问题
时间Wed Feb 18 23:09:23 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：→ MOONRAKER:搜寻关键字：「红黑树」(应该要嘘的） 61.228.20.119 02/18 23:31
2F：推 pponywong:这跟why应该没有关系吧...那些是规定 140.114.207.94 02/19 00:15
3F：→ pponywong:任何对树的动作..其结果都要符合rb tree 140.114.207.94 02/19 00:16
4F：→ pponywong:的规定...然後tree就会 self balance 140.114.207.94 02/19 00:16
5F：→ pponywong:感觉是订rule..有结果後再回去解释rule 140.114.207.94 02/19 00:17
6F：→ MOONRAKER:所以实在是应该要嘘的 59.112.195.205 02/19 22:03