This video by Simplilearn will explain to you about Arrays In C Programming Explained. Arrays In C Programming Tutorial For Beginners will explain Arrays in C With Examples of the types of Arrays In c. one-dimensional arrays and two-dimensional arrays, for example. This C programming tutorial will cover theoretical and practical demonstrations for a better learning experience. The video will cover the following concepts: 0:45-What Is an Array in C An array is a homogenous collection of elements of the same data type; Which means similar types of elements are stored under one name called an array name. 1:50-Array Declaration in C Data_type array_name[array_size]; 2:47-Array Initialization in C Int a[5]; 3:34-Access Array Elements in C if we want to access the 1st element of an array, then the index would be zero. Similarly, to access the last element, we specify a[4], and to access the 3rd element, give a[2], followed by a[3] to access element 25. 4:22-Types of Arrays in C First, we have a one-dimensional array. Next two dimensional arrays And finally, multi-dimensional arrays. 🔥 Explore our FREE courses with completion certificates: https://www.simplilearn.com/skillup-f... ✅Subscribe to our Channel to learn more about the top Technologies: https://bit.ly/2VT4WtH ⏩ Check out the C++ Programming training videos: https://www.youtube.com/playlist?list... #HeapDataStructureTutorial #MinHeap #MaxHeap #MinHeapAndMaxHeap #CProgram #CProgrammingLanguage #LearnCProgramming #CTutorialForBeginners #LearnCoding #CProgrammingTutorials #LearnCProgearnramming #Simplilearn What Is Heap Data Structure in C? In c programming, Heap is a complete tree-based data structure following a specific order. A heap consists of a root node/ parent node and a child node. The way roots are necessary for a tree. Similarly, a root node is very important in a heap. The element of a root node is always greater than or equal to its children nodes, or it can be smaller than or equal to its child node. Max heap In a max heap, the element of the root node must be greater than or equal to the elements of its children's nodes. Min heap The root node element of the min heap is lesser than or equal to its children node. 👉To know about C++ programming, visit: https://www.simplilearn.com/c-plus-pl... 🔥 Explore our FREE Courses with Completion Certificates: https://www.simplilearn.com/skillup-f... For more updates on courses and tips follow us on: - Facebook: https://www.facebook.com/Simplilearn - Twitter: https://twitter.com/simplilearn - LinkedIn: https://www.linkedin.com/company/simp... - Website: https://www.simplilearn.com - Instagram: https://www.instagram.com/simplilearn... - Telegram Mobile: https://t.me/simplilearnupdates - Telegram Desktop: https://web.telegram.org/#/im?p=@simp... Get the Simplilearn app: https://simpli.app.link/OlbFAhqMqgb.

2. Agenda
What Is Heap Data Structure in C?
Types of Heap Data Structure in C
Heap Insertion Operation
Heap Deletion Operation

3. What Is Heap Data Structure in C?

4. What Is Heap Data Structure in C?
Heap
Heap
Heap is a free pool or memory storage space to store data dynamically. When
program variables are allocated dynamically it is stored in the heap memory storage.
Dynamic variable

5. What Is Heap Data Structure in C?
In c programming, Heap is a complete tree-based data structure following a specific order. A
heap consists of root node/ parent node and child node
7
5 6
2 3
Root node / parent node
Child node
7 5 6 2 3
Array Representation
Heap Representation
0 1 2 3 4
0
1 2
6
4 5
3

6. Types of Heap Data Structure in C

7. Types of Heap Data Structure in C
Max heap
The element of the root node must be greater than or equal to the
elements of its children's nodes
Max heap example
7
5 6
2 3

8. Types of Heap Data Structure in C
Min heap
The element of the root node must be less than or equal to the elements
of its children's nodes
Min heap example
2
3 5
6 7

9. Types of Heap Data Structure in C
Max heap implementation
7
2 6
5 3
• Let the root node index be i which is the current element and set
the current element i to be the largest element.
• The left child index is given in terms of 2i+1 and the right child
index is 2i+2
• If the left child node or right child node element is larger than the
current element, then swap the elements and set it as the largest
element.
• Repeat the process until the tree is heapified.
2
5
0
1 2
3 4

10. Heap Insertion Operation

11. Insert one new element into the heap
Heap Insertion Operation
8
5 6
2 3
Let’s Insert element 7 into the heap
8
5 6
2 3 7

12. Heapify the tree. By swapping the elements
Heap Insertion Operation
Finally, an element is added to the heap
8
5 6
2 3 7
8
5 7
2 3 6

13. Heap Deletion Operation

14. Heap Deletion Operation
8
5 6
2 3 7
0
2
1
3 4 5
6
8
5 6
2 3 7
2
1
3 4 5
6
0
Delete one element from the heap
To delete element 5, swap the
element with the last node
element 7
8
7 6
2 3 5
2
1
3 4 5
3
6
0
Finally eliminate the
element from the heap