APPENDIX 1
Review of Trees
This appendix provides a brief review of trees. You should pay specific attention to the section on B-trees, since most DBMS suites implement them by default. Note: This appendix is not meant to replace a full course (and text) in data structures. It should therefore be regarded as an overview, not a final authority on the subject matter. This review covers the following sub-topics:
- Introduction to Trees
- Binary Trees
- Threaded Binary Trees
- Binary Search Trees
- Height-Balanced Trees
- Heaps
- M-way Search Trees and B-trees
- Summary and Concluding Remarks
A1.1 Introduction to Trees
The main difference between O(N2) sorting ...
Get Database Systems now with the O’Reilly learning platform.
O’Reilly members experience books, live events, courses curated by job role, and more from O’Reilly and nearly 200 top publishers.
