AuD
Lecture 'Algorithmen und Datenstrukturen' (code examples)
Package aud

AuD lecture: Data structures, algorithms, examples. More...

Packages

package  adt
 abstract data types
 
package  example
 examples and demos
 
package  graph
 Graph data structures and algorithms.
 
package  test
 unit tests based on JUnit 4
 
package  util
 utilities (not related to AuD lecture)
 

Classes

class  A234Tree< Key extends Comparable
 Simple implementation of 2-3-4-trees based on KTreeNode. More...
 
class  AVLTree< Key extends Comparable
 Simple implementation of an AVL tree. More...
 
class  BinarySearchTree< Key extends Comparable
 Base class for a binary search tree. More...
 
class  BinaryTree
 Simple binary tree. More...
 
class  BinaryTreeTraversal
 Provide traversals of binary trees. More...
 
class  BTree< Key extends Comparable
 Simple implementation of B-trees based on KTreeNode. More...
 
class  DList
 Implementation of a doubly linked list. More...
 
class  HashMap
 Implementation of an unordered map based on a hash table. More...
 
class  KTreeNode< Key extends Comparable
 Node in a k-ary search tree. More...
 
class  PriorityQueue
 Priority queue based on binary min-heap. More...
 
class  Queue
 Implementation of AbstractQueue as a (dynamically resized) circular buffer based on array. More...
 
class  QueueDL
 Impementation of AbstractQueue based on doubly linked list DList. More...
 
class  RedBlackTree< Key extends Comparable
 Simple implementation of a red-black tree. More...
 
class  SList
 Implementation of a singly linked list. More...
 
class  Stack
 Implementation of a stack based on aud.Vector. More...
 
class  Vector
 Implementation of an array-based vector. More...
 

Detailed Description

AuD lecture: Data structures, algorithms, examples.