Before you keep reading...
Runestone Academy can only continue if we get support from individuals like you. As a student you are well aware of the high cost of textbooks. Our mission is to provide great books to you for free, but we ask that you consider a $10 donation, more if you can or less if $10 is a burden.
Before you keep reading...
Making great stuff takes time and $$. If you appreciate the book you are reading now and want to keep quality materials free for other students please consider a donation to Runestone Academy. We ask that you consider a $10 donation, but if you can give more thats great, if $10 is too much for your budget we would be happy with whatever you can afford as a show of support.
6.20. Resumen
En este capítulo hemos examinado la estructura de los datos Árbol. La estructura de datos Árbol nos permite escribir muchos algoritmos interesantes. En este capítulo hemos estudiado algoritmos que utilizan árboles para hacer lo siguiente:
Un árbol binario para analizar y evaluar expresiones.
Un árbol binario para implementar el TAD Vector Asociativo.
Un árbol binario equilibrado (árbol AVL) para implementar el TAD Vector Asociativo.
Un árbol binario para implementar un montículo mín.
Un montículo mín utilizado para implementar una cola de prioridad.
You have attempted
of
activities on this page
