Binary Heap
It is a binary tree. Root is MAX. What is making Binary Heap which is so great ? Extremely Fast:
Category: Data Stuctures
Arrays, Linked List, Big O Notation, Stacks and Queues, Has Tables, Binary Trees, Binary Heaps, AVL & Red Tree, Fibonacci Series & Memoization.
Binary Trees
What is binary trees ? it is tree data structure. It contains nodes. a top node is root. Each node
HashTable
What is hash-table ? It is key-value data structure , it is really good for lookup data in the HashTable.
Stack & Queue
Stack is LIFO : Last in First Out Queue is FIFO: First in First Out Both of them are implemented
Big O Notation
Aka Time Complexity The efficiency of your algorithm Used to describe runtime characteristics of our data structures and algorithms O(1)
Linked List
What is it ? : Plain old data structure, no random access, fast add front O(1) It is a list
Arrays
What is an Arrays is ? : plain old data structure 3 things about array that you should know Can
