BTech/MCA/BCA - Computer Science - Trees - Heaps & Its Implementation Computer Science - Data Structure Notes - Part 5 (#mcanotes)(#ipumusings)
Trees - Heaps & Its Implementation
Computer Science - Data Structure Notes - Part 5
Data structures are the building blocks of any programming language. Following are the PDF notes on Data Structures, help you in your studies. For large amounts of input, the linear access time of linked lists is prohibitive. A tree can be defined in several ways. A tree is a collection of nodes.
A Binary Heap is a Binary Tree with following properties:
(1) It’s a complete tree (All levels are completely filled except possibly the last level and the last level has all keys as left as possible). This property of Binary Heap makes them suitable to be stored in an array.
(2) A Binary Heap is either Min Heap or Max Heap. In a Min Binary Heap, the key at root must be minimum among all keys present in Binary Heap. The same property must be recursively true for all nodes in Binary Tree. Max Binary Heap is similar to Min Binary Heap.
See also:
Abstract Data Type (Q & A)
DS End Term Paper (2017)
Data Structure Notes (Part 1) - Trees
Data Structures Notes (Part 2) - Trees
Data Structures Notes (Part 3) - Trees
