Welcome to Gardion Learning Site

AVL is another version of Binary Search Tree. The concept of AVL is still the same with binary search tree, but this time they limit to...

Well let's recap what we have learn. We have learned about linked list, double linked list, stack, queue, prefix, postfix, infix, Hashing...

Now we're going to learn about hash and hash table You can imagine array and linked list combine, you get hash Complexity depends on the...

First we're going to explain about stack concept Stack is like stacking a box, you cannot move the bottom box, but you must move the top...

Linked list adalah cara untuk konek satu data ke data lain, mirip kayak array tapi linked list lebih bagus karena dia tidak diberi batas,...