- Heap
- Heapify means arrange all nodes in correct order.
- Create min and max heap separately.
- Q. Is there any difference insequential_representation (array) andLinked_Representation (create class) time complexities of heap?
- heapifytime_complexity
- This is correct heap tree,
- Why did Ayush Pandey mention binary search tree here?
- Delete key:
- Operations:
- Extract: logn
- delete: log n
- Linked_Representation vssequential_representation ?
- Heap is best example to be implemeting assequential_representation as no space is left in array, array all blocks will be occupied after operation like heapify.
- Go forsequential_representation for Heap.
- Homework:
- Heapify
- Decrease key
- Delete key
- Extract a key (min heap)