[問題] 資料結構中的紅黑樹問題
老師講完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
推
02/19 04:53, , 1F
02/19 04:53, 1F
推
02/20 00:33, , 2F
02/20 00:33, 2F
→
02/20 00:50, , 3F
02/20 00:50, 3F
推
02/20 16:36, , 4F
02/20 16:36, 4F
CSSE 近期熱門文章
PTT數位生活區 即時熱門文章
