[問題] 不是BFS 也不是DFS 那這有甚麼名字嗎?
一個Tree的結構
找出合乎條件的第一個Node
虛擬碼如下
Node* Find (Node* cur, bool (*comp)(Node*))
{
if (cur == NULL)
return NULL;
for each child of cur
{
if (comp(child))
return child;
}
for each child of cur
{
return Find (child, comp);
}
}
有點類似 first child next sibling 結構的 search
這樣的演算法有名字嗎?
對無特別規則的tree來說有甚麼明顯缺點嗎?
--
※ 發信站: 批踢踢實業坊(ptt.cc), 來自: 1.171.210.120
※ 文章網址: http://www.ptt.cc/bbs/C_and_CPP/M.1411048487.A.58B.html
推
09/18 22:08, , 1F
09/18 22:08, 1F
→
09/18 22:08, , 2F
09/18 22:08, 2F
→
09/18 22:10, , 3F
09/18 22:10, 3F
→
09/18 22:11, , 4F
09/18 22:11, 4F
→
09/19 00:45, , 5F
09/19 00:45, 5F
→
09/19 00:54, , 6F
09/19 00:54, 6F
→
09/19 02:33, , 7F
09/19 02:33, 7F
推
09/19 04:52, , 8F
09/19 04:52, 8F