"algorithms 4th"---symbol table


Symbol tables are used to store key-value pairs. In common arrays, we just take keys as the order index from 0 to n, and we save value.

Symbol tables used for searching by their keys not their values, so their keys needs to be comparable.

There are two kinds of data structures, the first kind is sequential table, implemented by list; the second kind is tree structure, which aims to meet demand for both binary search and insertion speed.

We usually use hash tables in application in order for convenience rather than BBST.

评论
添加红包

请填写红包祝福语或标题

红包个数最小为10个

红包金额最低5元

当前余额3.43前往充值 >
需支付:10.00
成就一亿技术人!
领取后你会自动成为博主和红包主的粉丝 规则
hope_wisdom
发出的红包
实付
使用余额支付
点击重新获取
扫码支付
钱包余额 0

抵扣说明:

1.余额是钱包充值的虚拟货币,按照1:1的比例进行支付金额的抵扣。
2.余额无法直接购买下载,可以购买VIP、付费专栏及课程。

余额充值