Geometric Applications of BSTs

1. Draw the 2d-tree (both the binary tree and the subdivision of the plane) that results when the points (2,1) (5,6) (8,2) (6,3) (4,7) (3,9) and (1,4) are inserted in the order given into an initially empty 2d-tree. Start by subdividing on the x-coordinate of the root, as in the lecture slides

Undirected Graphs

1. List the vertices in the order in which they are visited (for the first time) in DFS for the following undirected graph, starting from vertex 0.

0-1, 1-2, 1-7, 2-0, 2-4, 3-2, 3-4, 4-5, 4-6, 4-7, 5-3, 5-6, 7-8, 8-6

For simplicity, assume that the graph implementation always iterates through the neighbors of a vertex in increasing order.

Academic Honesty!
It is not our intention to break the school's academic policy. Projects posted are only used as a reference and should not be submitted as is. We are not held liable for any misuse of the solutions. Please see the frequently asked questions page for further questions and inquiries.
Kindly fill out the form. Please provide a valid email address and we'll get back to you in less than 24 hours. We will be sending an invoice through PayPal upon confirmation. We are a non profit organization however we need an amount to keep this organization running, and to be able to complete our research and development.