.. 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-07-14 13:59:31"; 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

Object Oriented Programming
===========================

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

   IntroOO
   IntroUML
   IntroProcess

Debugging
=========

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

   debugmethods
   debug

Introduction to Data Structures
===============================

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

   IntroDSA
   ADT

Testing Concepts
================

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

   TestIntro
   Example2
   Bowling
   junitstart
   junitbasic
   TestCoverage
   junitcoverage

Recursion
=========

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

   RecIntro
   Write
   CodeCompletionEx
   HarderWrite
   HarderCodeCompletionEx
   WritingEx
   Trace
   TracingEx
   RecSummaryEx

Lists
=====

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

   ListADT
   ListArray

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

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

   AnalPrelim
   AnalIntro
   AnalCases
   AnalCompvsAlg
   AnalAsymptotic
   AnalProgram
   AlgAnalSummCS2

Stacks
======

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

   StackArray
   StackLinked

Queues
======

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

   Queue
   QueueLinked

Sorting
=======

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

   InSort
   SortNotation
   Comparison
   InsertionSort
   BubbleSort
   SelectionSort

Linked Lists
============

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

   ListLinked
   ListAnalysis
   ListDouble
   ListElement
   Freelist
   ListSumm

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

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

   BinaryTreeIntro
   BinaryTree
   RecursiveDS
   BinaryTreeFullThm
   BinaryTreeTraversal
   WritingTraversals
   BinaryTreeInfFlw
   BinaryTreeImpl
   Composite
   BinaryTreeNodeSpace
   BST
   BSTDict
   BinaryTreeGuidedInfFlw
   MultipleBinaryTrees
   BSTCheck
   CompleteTree
   Heaps
   Huffman
   TreeTrie
   HuffProof
   BinaryChapSumm

Hashing
=======

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

   HashIntro
   HashFunc
   HashFuncExamp
   OpenHash
   BucketHash
   HashCSimple
   HashCImproved
   HashAnal
   HashDel
   HashSumm

Graphs
======

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

   GraphIntro
   GraphTraversal
   GraphImpl
   GraphCM
   Kruskal
   Floyd
   MCST
   GraphShortest
   GraphTopsort

Appendix
========

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

   Glossary
   Bibliography


.. toctree::
   :maxdepth: 3


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