Đang chuẩn bị liên kết để tải về tài liệu:
An Introduction to Binary Search Trees and Balanced Trees

Philosophical debates have arisen over the present and future use of technology in society, with disagreements over whether technology improves the human condition or worsens it. Neo-Luddism, anarcho-primitivism, and similar movements criticise the pervasiveness of technology in the modern world, opining that it harms the environment and alienates people; proponents of ideologies such as transhumanism and techno-progressivism view continued technological progress as beneficial to society and the human condition. Indeed, until recently, it was believed that the development of technology was restricted only to human beings, but recent scientific studies indicate that other primates and certain dolphin communities have developed. | An Introduction to Binary Search Trees and Balanced Trees Libavl Binary Search Tree Library Volume 1 Source Code Version 2.0.2 by Ben Pfaff Copyright 1998-2002 2004 Free Software Foundation Inc. This program is free software you can redistribute it and or modify it under the terms of the GNU General Public License as published by the Free Software Foundation either version 2 of the License or at your option any later version. This program is distributed in the hope that it will be useful but WITHOUT ANY WARRAnTy without even the implied warranty of MERCHANTABILITY or FITNESS FOR A particular purpose. See the GNU General Public License for more details. You should have received a copy of the GNU General Public License along with this program if not write to Free Software Foundation Inc. 59 Temple Place - Suite 330 Boston ma 02111-1307 UNITED states The author may be contacted as blp@gnu.org on the Internet or write to Ben Pfaff Stanford University Computer Science Dept. 353 Serra Mall Stanford CA 94305 UNITED states 1 Brief Contents Preface . 1 1 Introduction.3 2 The Table ADT.7 3 Search Algorithms.19 4 Binary Search Trees.29 5 AVL Trees. 107 6 Red-Black Trees. 139 7 Threaded Binary Search Trees.163 8 Threaded AVL Trees. 191 9 Threaded Red-Black Trees. 209 10 Right-Threaded Binary Search Trees. 225 11 Right-Threaded AVL Trees.247 12 Right-Threaded Red-Black Trees.263 13 BSTs with Parent Pointers.277 14 AVL Trees with Parent Pointers.293 15 Red-Black Trees with Parent Pointers.307 A References. 321 B Supplementary Code. 323 C Glossary.331 D Answers to All the Exercises.335 E Catalogue of Algorithms.405 F .