top of page
Studying on the Grass

Welcome to Gardion Learning Site

Naturally Curious

Home: Welcome
Search

06 - AVL

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...

05- Review

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

04 - Binary Tree

Well, now you're going to learn about Binary Tree, Binary Tree is a concept that allows faster searching (than linear), well why are you...

03 Hash

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...

02 Stack, queue, prepoin

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...

Learning Linked List

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

Home: Blog2

Thanks for submitting!

Home: Subscribe

Contact

Binus University Alam Sutera

Thanks for submitting!

Home: Contact

Subscribe Form

Thanks for submitting!

  • Facebook
  • Twitter
  • LinkedIn

©2020 by Gardion Learning Site. Proudly created with Wix.com

bottom of page