博客园  :: 首页  :: 新随笔  :: 联系 :: 订阅 订阅  :: 管理

2009年11月14日

摘要: Given input {4371, 1323, 6173, 4199, 4344, 9679, 1989} and a hash function h(X) = X (mod 10), show the resulting:a. Separate chaining hash table.b. Open addressing hash table using linear probing.c. Open addressing hash table using quadratic probing.d. Open addressing hash table with second hash fun 阅读全文

posted @ 2009-11-14 17:02 little健健 阅读(969) 评论(0) 推荐(0) 编辑

摘要: a). Show the result of inserting the following keys into an initially empty 2-3 tree: 3, 1, 4, 5, 9, 2, 6, 8, 7, 0.b). Show the result of deleting 0 and then 9 from the 2-3 tree created in part (a).a)b) 阅读全文

posted @ 2009-11-14 00:44 little健健 阅读(318) 评论(0) 推荐(0) 编辑