Full video on how to insert an element into heap step by step discussion (here case is max heap)
Full video on how to insert an element into heap step by step discussion (here case is max heap)|
heap | heap tree | heap tree in data structure | what is heap | heap sort max heap | max heap and min heap in data structure | max heap | max heapify |min heap and max heap | min heap | min heap dsa | heap in data structure | heap in dsa | heap insertion | heapify algoruthm | heapify method | heap sort max heap |
The video discusses the following :
How to find out parent position & child nodes positions of a node in an array which is a heap | Algorithm for inserting n elements into heap is of O(nlogn) explain | What does it mean by insertion of a single node into a heap is O(logn) ? | What does it mean by insertion of a single node into a heap is O(logn) ? | Identifying an one dimensional array satisfying heap property & is either max heap or min heap | How to check whether an one dimensional array is representing a heap or not ? | What will be heap in one dimensional array representation after inserting a new node ? | Final heap and its equivalent one dimensional array representation | Final max heap is to be represented as one dimensional array like binary tree representation | Newly inserted node stops upward moving as heap property is restored at this position in heap | How upward movement of newly inserted node is taking place to restore heap property ? | Upward movement of newly inserted node continues till heap property in restored for each node | Upward movement of newly inserted node continues till heap property in restored for each node | How tree will look when newly inserted node does upward movement to restore heap property ? | How to restore heap property when inserting a new node into heap ? | When inserting a new node into heap at 2nd step how heap property is restored ? | First step to insert a new node into a heap (here the case is max heap) | How to check whether a binary tree is a max heap or not ? | What will be number of nodes in intermediate levels in a heap tree ? | Heap represented as one dimensional array is converted to equivalent tree structure | How to find position of child nodes of a node in heap represented as one dimensional array ? | In which order nodes in heap are stored in memory as one dimensional array ? | How heap is represented in memory ? As one dimensional array | What is max heap and what is min heap ? how they differ explain | To keep heap property position of new node inserted after last node is to be changed | Steps to insert element into heap - insert new node after last node & restore heap property | Properties of heap | relation in terms of values between parent and child nodes in max heap | Heap | Properties of heap | Number of child a node can have in heap | Steps to insert element into heap - insert new node after last node & restore heap property | Properties of heap | relation in terms of values between parent and child nodes in max heap | Heap | Properties of heap | Number of child a node can have in heap | Properties of heap | relation in terms of values between parent and child nodes in max heap | Heap | Properties of heap | Number of child a node can have in heap | Heap | Properties of heap | Number of child a node can have in heap |
#vlog #youtube #computerscience #computerscienceengineering #datastructure #datastructures #heap #binarytree #datastructureandalgorithm #datastructuresandalgorithms #datastructureandalgorithms #shorts #short #shortsvideo #shortvideo #shortsviral #shortsyoutube #videos #viralvideos #video #videoshort #videoshorts #viralvideo #viralvideoshorts #tree #trees #binarytree #gate #gateexam #gateexampreparation