Offered as an introduction to the field of data structures and algorithms, Open Data Structures covers the implementation and analysis of data structures for sequences (lists), queues, priority queues, unordered dictionaries, ordered dictionaries, and graphs. Focusing on a mathematically rigorous approach that is fast, practical, and efficient, Morin clearly and briskly presents instruction along with source code.

Analyzed and implemented in Java, the data structures presented in the book include stacks, queues, deques, and lists implemented as arrays and linked-lists; space-efficient implementations of lists; skip lists; hash tables and hash codes; binary search trees including treaps, scapegoat trees, and red-black trees; integer searching structures including binary tries, x-fast tries, and y-fast tries; heaps, including implicit binary heaps and randomized meldable heaps; and graphs, including adjacency matrix and adjacency list representations; and B-trees.

A modern treatment of an essential computer science topic, Open Data Structures is a measured balance between classical topics and state-of-the art structures that will serve the needs of all undergraduate students or self-directed learners.Pat Morin is an associate professor in the School of Computer Science at Carleton University as well as founder and managing editor of the open access Journal of Computational Geometry. He is the author of numerous conference papers and journal publications on the topics of computational geometry, algorithms, and data structures.

提供介绍数据结构和算法,开放数据结构包括数据结构的实现和分析序列(列表)、伫列、优先权伫列、无序的字典、有序的字典,和图表。专注于一个严格的数学方法,是快速、实用、有效,莫林明显和迅速呈现指令以及原始码。

分析和实现在Java中,书中给出的数据结构包括栈、伫列、双端伫列,和列表作为数组和鍊表,实现空间的实现列表;跳过列表;哈希表,哈希码;二进制搜寻树包括treaps替罪羊树,红黑树;整数搜寻结构包括二进制试,x-fast努力,和y-fast尝试;堆,包括隐式二进制堆和随机热熔堆;和图表,包括邻接矩阵和邻接表表示法;b树。

计算机科学现代治疗的一个重要主题,开放数据结构是一个测量平衡经典主题和先进的结构,将所有本科生或自主学习者的需要。帕特莫林副教授在卡尔顿大学计算机科学学院的创始人兼总编辑以及计算几何的开放获取期刊。他是众多会议论文的作者和期刊出版物在计算几何的主题,算法和数据结构。