search

CasperBHansen / DIKU_AD_2013

A disposition for the algorithms and data structures course exam.
4 stars 0 forks source link

Ch 3. #14

Closed Genesiz closed 11 years ago

Genesiz commented 11 years ago

How to do, use and maintain;

Insertion Deletion Rotation Rebalancing.

And what extra algortihmes are used to do the same actions on AVL / Red-black

Propertys of binary search trees

Ways of searching a binary search tree

Proof of running time

Different kinds of trees ( AVL, Red-Black). Usages of binary search trees.

CasperBHansen commented 11 years ago

These sections exist already, they just need some text to fill them out. The main point of the chapter aren't these sections though, so refer to issue https://github.com/CasperBHansen/DIKU_AD_2013/issues/29 first, these aren't of as high priority at this time.