My treap maintains both the heap and BST properties, but the parent nodes of each node in the treap isn't always correct, and I think it's because of how I'm rotating. Here are my rotation functions: ...

I am aware of some of the advantages of using AVL trees such as getting better time complexity to search an element log(number of nodes in tree) since the tree has self-balancing capabilities. I am cu...

I know AVL tree's search and insertion time complexity is supposed to be O(logn), but with the tree I built, when I make a graph with the times it takes to do N operations, it ends up beeing a N graph...

I am exploring a problem where I have to keep track of the number of strings that contains a certain substring. I was wondering how do I use an AVL tree to solve it. Here is the problem/question: http...