.. This file is part of the OpenDSA eTextbook project. See
.. http://opendsa.org 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 = "2020-08-23 13:21:51"; 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

Appendix
========

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

   Glossary
   Bibliography

Background
==========

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

   Intro
   MathpreIntro
   Logarithms
   MiscMath
   Summations
   Proofs
   MathpreSumm
   RecurrenceIntro
   Math
   Math
   AlgAnal

Algorithm Analysis
==================

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

   AnalChap
   AnalProblem
   AnalProgram
   AnalCases
   AnalMisunderstanding
   AnalPrelim
   AlgAnalSummCS2
   AlgAnalSummCS3
   Intro
   AlgAnal

Lists, Stacks, and Queues
=========================

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

   Lists
   ListElement
   ListADT
   StackQueue
   StackQueue
   ListIntro
   ListArray
   ListAnalysis
   ListLinked
   StackArray
   StackLinked
   QueueLinked
   Queue

Sorting
=======

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

   Sorting1
   Sorting2
   Sorting2
   Heapsort
   MergesortImpl
   Quicksort
   Mergesort
   SortingEmpirical
   InSort
   SortSumm

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

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

   BinaryTreeIntro
   Binary
   Binary2
   Binary3
   BinaryTree
   BinaryTreeImpl
   BinaryChapSumm
   RecursiveDS
   BinaryTreeTraversal
   WritingTraversals
   CompleteTree
   Huffman
   Huffman
   BST
   BST
   BalancedTree
   AVL
   Splay

Heaps (Priority Queues)
=======================

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

   Heaps
   Heaps
   Heaps

Hashing
=======

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

   Hashing
   Hashing
   HashCSimple
   HashCImproved
   HashIntro
   HashFuncExamp
   HashFunc
   HashSumm

Maps and Sets
=============

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

   Union-Find
   Union-Find
   GraphImpl

Graphs
======

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

   Graphs
   Graphs
   Floyd
   GraphCM
   GraphIntro
   Kruskal
   GraphShortest
   GraphTopsort
   GraphTraversal
   MCST

Backtracking
============

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


Dynamic Programming
===================

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


Divide and Conquer Algorithms
=============================

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



.. toctree::
   :maxdepth: 3


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