.. This file is part of the OpenDSA eTextbook project. See
.. http://algoviz.org/OpenDSA for more details.
.. Copyright (c) 2012-2016 by the OpenDSA Project Contributors, and
.. distributed under an MIT open source license.

.. OpenDSA documentation master file, created by
   sphinx-quickstart on Sat Mar 17 18:07:39 2012.
   You can adapt this file completely to your liking, but it should at least
   contain the root `toctree` directive.

.. avmetadata:: OpenDSA Sample eTextbook
   :author: OpenDSA Contributors
   :topic: Data Structures

.. chapnum::
   :start: 0
   :prefix: Chapter

.. _index:

.. raw:: html

   <script>ODSA.SETTINGS.DISP_MOD_COMP = false;ODSA.SETTINGS.MODULE_NAME = "index";ODSA.SETTINGS.MODULE_LONG_NAME = "Contents";ODSA.SETTINGS.MODULE_CHAPTER = ""; ODSA.SETTINGS.BUILD_DATE = "2018-08-24 15:53:30"; ODSA.SETTINGS.BUILD_CMAP = false;</script>


.. |--| unicode:: U+2013   .. en dash
.. |---| unicode:: U+2014  .. em dash, trimming surrounding whitespace
   :trim:


Preface
=======

.. toctree::
   :numbered:
   :maxdepth: 3

   Intro

Background
==========

.. toctree::
   :numbered:
   :maxdepth: 3

   MathpreIntro
   MathpreSumm
   IntroDSA
   Estimation
   Logarithms
   Proofs
   MiscMath
   RecurrenceIntro
   SetDef
   Summations

Design
======

.. toctree::
   :numbered:
   :maxdepth: 3

   DesignAltList
   ADT
   Comparison
   IntroOO
   IntroProcess
   DesignPatterns
   Dictionary
   IntroUML

AlgAnal
=======

.. toctree::
   :numbered:
   :maxdepth: 3

   AnalChap
   AlgAnalSummCS3
   AlgAnalSummCS2
   AnalProblem
   AnalAsymptotic
   AnalCases
   AnalPrelim
   AnalTuning
   AnalProgram
   AnalMisunderstanding
   AnalIntro
   AnalLower
   AnalCompvsAlg
   AnalSpace
   AnalMultiple

Appendix
========

.. toctree::
   :numbered:
   :maxdepth: 3

   Glossary
   Bibliography

Pointers
========

.. toctree::
   :numbered:
   :maxdepth: 3

   BasicPointers
   HeapMem
   LocalMem
   PointerIntro
   Exercises
   RefParam

Linear Structures
=================

.. toctree::
   :numbered:
   :maxdepth: 3

   ListAnalysis
   ListArray
   ListDouble
   Freelist
   StackRecur
   QueueLinked
   ListIntro
   StackLinked
   ListSumm
   StackArray
   ListElement
   ListLinked
   Queue
   ListADT

Binary Trees
============

.. toctree::
   :numbered:
   :maxdepth: 3

   CompleteTree
   BST
   BinaryChapSumm
   BinaryTreeImpl
   BinaryTreeNodeSpace
   BinaryTreeTraversal
   RecursiveDS
   BinaryTree
   BinaryTreeIntro
   Composite
   BSTDict
   Heaps
   BinaryTreeFullThm
   WritingTraversals


.. toctree::
   :maxdepth: 3


* :ref:`genindex`
* :ref:`search`