O'Reilly logo

Database Systems by Shripad V. Godbole, Elvis C. Foster

Stay ahead with the world's most comprehensive technology and business learning platform.

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, tutorials, and more.

Start Free Trial

No credit card required

APPENDIX 1

image

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 ...

With Safari, you learn the way you learn best. Get unlimited access to videos, live online training, learning paths, books, interactive tutorials, and more.

Start Free Trial

No credit card required