ADA ( Advanced Data structures Animations ) aims to build a collection of animation algorithms that aide the learning and understanding of advanced data structures.

Three categories of data structures are treated :

• One dimensional data structures
• Multidimensional data structures
• Distributed data structures

Among the advanced one dimensional data structures we considered the three following : (currently 0 program) * B-trees * LH ( Linear Hashing) * TH ( Trie Hashing ).

Thereafter, we show how these data structures are extended to the multidimensional case (currently 1 program)

• MLH : Multidimensional Linear Hashing
• MTH : Multidimensional Trie Hashing
• MB-trees Multidimensional B-trees

then, the distributed case : (currently 0 program)

• LH* : Distributed Linear Hashing
• TH* : Distributed Trie Hashing
• RP*: Distributed B-trees

We aim to show the construction mechanisms and the operations on these constructions such as searching, deleting and others.

Other classical data structures can integrate ADA. (currently 1 program)

We accept many various programs for the same data structure.

Programs must be written in JavaTM 2 SDK, Standard Edition