About this document
CS301 Assignment: Heap Data Structure by Imran Kashif is a document available to read on EtoBox.
This document outlines Assignment No. 03 for the CS301 Data Structures course. It provides instructions for submitting the assignment by the August 7th deadline and notes that assignments not following the submission guidelines will receive zero marks. The objective is to demonstrate understanding of complete binary trees and heap data structures. Students are given an array representing a complete binary tree and tasks to draw the tree, identify if it is a min or max heap, and draw the updated tree after i
- Author
- Imran Kashif
- Language
- EN