首页 > 其他好文 > 详细

Overview of Data Structures

时间：2014-09-29 13:26:30 阅读：271 评论：0 收藏：0 [点我收藏+]

标签：des io ar strong for sp div art on

Data Structure


	Advantages


	Disadvantages


	Array


	Quick insertion, very fast access if index known


	Slow search, slow deletion, fixed size.


	Ordered array


	Quicker search than unsorted array.


	Slow insertion and deletion, fixed size.


	Stack


	Provides last-in, first-out access.


	Slow access to other items.


	Queue


	Provides first-in, first-out access.


	Slow access to other items.


	Linked list


	Quick insertion, quick deletion.


	Slow search.


	Binary tree


	Quick search, insertion, deletion (if tree remains balanced).


	Deletion algorithm is complex.


	Red-black tree


	Quick search, insertion, deletion. Tree always balanced.


	Complex.


	2-3-4 tree


	Quick search, insertion, deletion. Tree always balanced. Similar trees good for disk storage.


	Complex.


	Hash table


	Very fast access if key known. Fast insertion.


	Slow deletion, access slow if key not known, inefficient memory usage.


	Heap


	Fast insertion, deletion,


	Slow access to other items.access to largest item.


	Graph


	Models real-world situations.


	Some algorithms are slow and complex.

Overview of Data Structures

标签：des io ar strong for sp div art on

原文地址：http://www.cnblogs.com/banxian/p/3999744.html

踩

(0)

赞

(0)

举报

评论一句话评论（0）

分享档案

更多>

2021年07月29日 (22)
2021年07月28日 (40)
2021年07月27日 (32)
2021年07月26日 (79)
2021年07月23日 (29)
2021年07月22日 (30)
2021年07月21日 (42)
2021年07月20日 (16)
2021年07月19日 (90)
2021年07月16日 (35)

周排行

更多

友情链接

兰亭集智国之画百度统计站长统计阿里云 chrome插件新版天听网

关于我们 - 联系我们 - 留言反馈

© 2014 mamicode.com 版权所有联系我们:gaon5@hotmail.com

迷上了代码！