tailieunhanh - An Introduction to Binary Search Trees and Balanced TreesLibavl Binary Search Tree Library Volume 1: Source Code Version 2.0.2 by Ben Pfaff Copyright c 1998–2002, 2004

A computer is a general purpose device that can be programmed to carry out a finite set of arithmetic or logical operations. Since a sequence of operations can be readily changed, the computer can solve more than one kind of problem. | An Introduction to Binary Search Trees and Balanced Trees Libavl Binary Search Tree Library Volume 1 Source Code Version 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@ 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 2 The Table 3 Search 4 Binary Search 5 AVL Trees. 107 6 Red-Black Trees. 139 7 Threaded Binary Search 8 Threaded AVL Trees. 191 9 Threaded Red-Black Trees. 209 10 Right-Threaded Binary Search Trees. 225 11 Right-Threaded AVL 12 Right-Threaded Red-Black 13 BSTs with Parent 14 AVL Trees with Parent 15 Red-Black Trees with Parent A References. 321 B Supplementary Code. 323 C D Answers to All the E Catalogue of F .