討論串(共11篇) - Red/black trees - 看板DFBSD_kernel

看板 [ DFBSD_kernel ]

討論串Red/black trees

共 11 篇文章

排序：最新先 | 最舊先 | 留言數 | 推文總分

內容預覽：開啟 | 關閉 | 只限未讀

首頁

尾頁

Re: Red/black trees

推噓0(0推 )留言0則，0人參與作者asmodai.時間21年前 (2005/04/18 14:32)資訊

內容預覽:

-On [20050418 08:12], Matthew Dillon (dillon@apollo.backplane.com) wrote:. > I'm not sure what you mean. What is a 'skip' list and how would it. > com

Re: Red/black trees

推噓0(0推 )留言0則，0人參與作者dillon.時間21年前 (2005/04/18 14:32)資訊

內容預覽:

I'm not sure what you mean. What is a 'skip' list and how would it. compare against a red-black tree ?. -Matt. Matthew Dillon. <dillon@

Re: Red/black trees

推噓0(0推 )留言0則，0人參與作者akapoor.時間21年前 (2005/04/18 13:01)資訊

內容預覽:

Matthew Dillon <dillon@apollo.backplane.com> writes:. > :So what advantage do the red-black trees have, since the previous data. > :structure has been

(還有458個字)

Re: Red/black trees

推噓0(0推 )留言0則，0人參與作者df.時間21年前 (2005/04/18 03:32)資訊

內容預覽:

On Sunday 17 April 2005 03:16, Matthew Dillon wrote:. > The previous data structure was a doubly linked list with a bunch of. > hacks to try to make i

(還有80個字)

Re: Red/black trees

推噓0(0推 )留言0則，0人參與作者dillon.時間21年前 (2005/04/17 09:32)資訊

內容預覽:

The previous data structure was a doubly linked list with a bunch of. hacks to try to make insertions go faster. The red-black tree should. be just as

(還有32個字)

首頁

尾頁