Note: this module is not actively maintained bar for bug fixes. Its primary use is within NeDB and I do not plan on adding any new features. Two implementations of binary search tree: basic and AVL (a ...

The goal of this assignment is to compare the AVL Tree with Binary Search Tree, both implemented in Java, using a real-world application to read in and provide access to dam water level data.

But, it is not so trivial in a BST. Consider the binary search tree . 38 / \ 5 45 / \ \ 1 9 47 / \ / ... AVL trees are good data structures to maintain an “almost” balanced tree. However, AVL trees ...