[問題] 資料結構中的紅黑樹問題

[sboomer (鴨子)]

老師講完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
→ MOONRAKER:搜尋關鍵字：「紅黑樹」(應該要噓的）
推 pponywong:這跟why應該沒有關係吧...那些是規定
→ pponywong:任何對樹的動作..其結果都要符合rb tree
→ pponywong:的規定...然後tree就會 self balance
→ pponywong:感覺是訂rule..有結果後再回去解釋rule
→ MOONRAKER:所以實在是應該要噓的