dslib v1.1

• thread-safe AVL implementation
• fix AVL traversal bug
• fix address-sanitizer reports
• add CMakeLists.txt

dslib v1.0

data structures implemented

• dlist: Circular doubly linked list with a void pointer pointing to the data in each node. As you can guess, the library doesn't take care (de)allocating the actual memory used for the data. A node simply points to the data plus next and previous node pointers.
• queue: Builds on top of dlist. Each element is a dlist node pointing to the value inserted in the queue.
• stack: Builds on top of dlist. Each element is a dlist node pointing to the value pushed in the stack.
• tree: A binary search tree, stores integers.
• AVL: An AVL tree implementation, stores integers.
• BFS: Iterative Breadth-first search for tree and AVL implemented using the queue.
• DFS: Iterative Depth-first search for tree implemented using the stack.