This Library contains different implementations of the tree data structures, such as K-ary, binary, expression trees etc. A tree data structure can be defined recursively (locally) as a collection of ...

boolean add(E e) Adds the specified element to this tree if it is not already present. boolean addAll(Collection<? extends E> collection) Adds all of the elements in the specified collection to this ...

Abstract: In a previous work, we presented a technique that allows verifying the conformance between Java implementations and UML class diagrams, using design tests. While it allowed verifying ...