Binary Search Tree 1
$30-5000 USD
Pagado a la entrega
Data for problems 1, 2, and 3 below.
*A* = {27, 31, 8, 21, 12, 48, 21, 37}
1. Build a binary search tree from the above data. Pick the elements from left to right in the array.
2. Draw a min heap from the above data. Pick the elements from left to right.
## Deliverables
3. In the search tree of problem 1, how many comparisons would be needed to search for an element with key 25?
4. List the elements in a post-order walkthrough of the search tree in problem 1.
## Platform
Send the solution as a .doc file.
**THE DEADLINE FOR THIS IS THURSDAY NOV 13TH 03**.
Nº del proyecto: #3006945
Sobre el proyecto
Adjudicado a:
16 freelancers están ofertando un promedio de $18 por este trabajo
