0% found this document useful (0 votes)
11 views1 page

Assignments

The document discusses binary search trees and heap trees. It provides a list of integer numbers and instructions to draw the trees initially, after inserting additional values, and after deleting values.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
0% found this document useful (0 votes)
11 views1 page

Assignments

The document discusses binary search trees and heap trees. It provides a list of integer numbers and instructions to draw the trees initially, after inserting additional values, and after deleting values.
Copyright
© © All Rights Reserved
We take content rights seriously. If you suspect this is your content, claim it here.
Available Formats
Download as DOCX, PDF, TXT or read online on Scribd
You are on page 1/ 1

Homework lecture 6

Binary and Heap trees


1. Given a list of integer numbers: 2, 1, 10, 6, 3, 8, 7, 13, 20.
- Draw the binary search tree
- Draw the binary search tree after inserting values: 14, 0, 35
- Draw the binary search tree after deleting: 6, 13, 35

2. Given a list of integer numbers: 2, 1, 10, 6, 3, 8, 7, 13, 20.


- Draw the heap tree
- Draw the heap tree after inserting values: 14, 0, 35
- Draw the heap tree after deleting: 6, 13, 35

You might also like