Here is my c++ complete bst code. It’s like AVL trees, without rotations. It rebuilds tree when rebalancing is required.

Here is my doubly linkedlist code. I coded this for my homework. List consists of nodes.

Here’s a stack implementation, written in C++ with templates. I used this code in my homework for c++ class. (ceng213 – data structures)