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