Professional Documents
Culture Documents
Sheet 3
Sheet 3
Sheet 3
Binary Heap - DFS - BFS
2. Delete the max keys from the heap formed in the last question one by one until the heap
becomes empty.
3. Convert the following array to a min binary heap using O(n) algorithm showing all your
steps: [9, 12, 7, 2, 5, 1, 6].
2. Number of Islands
3. Course Schedule
4. Symmetric Tree
3 Submission
• You need to submit your solutions as pdf to ms teams as usual.
• Submitting the solutions to the sites and getting Accepted will be graded as a bonus.
• If you did the bonus you can put screenshots of your accepted code in addition to screen-
shot for your result in the problem from the site as your solution in the submitted pdf in
ms teams.
Good Luck