[理工] 幾個資料結構小問題 DS

看板Grad-ProbAsk作者carefree1205 (Mintur)時間12年前 (2014/01/24 22:28)推噓7(7推 0噓 9→)

留言16則, 7人參與討論串1/1

以下幾題可以看成是非題 1. In static hashing, when the value of loading density is equal to the value of the key density of the hashing table, then overflow will not occur. 我知道Identifier density和loading density的個別定義還有Loading density越接近1表示越容易collision 但是和Identifier density有甚麼關係嗎? 2. Given a graph G, if there is a vertex v of G such that DFS(v) spanning tree is also the BFS(v) spanning tree of G, then G is also a tree structure. 3. The space complexity of a recursive search function for T is O(logn). 以上兩題不是很確定還請板友指教謝謝 -- ※ 發信站: 批踢踢實業坊(ptt.cc) ◆ From: 61.227.154.182

→

hsuanyao

01/24 22:34, , 1^F

01/24 22:34, 1^F

推

A4P8T6X9

01/24 22:36, , 2^F

01/24 22:36, 2^F

→

A4P8T6X9

01/24 22:42, , 3^F

01/24 22:42, 3^F