Curs 3 - Agenda - Profs.info.uaic.ro
Curs 3 - Agenda - Profs.info.uaic.ro
Curs 3 - Agenda - Profs.info.uaic.ro
SHOW LESS
Create successful ePaper yourself
Turn your PDF publications into a flip-book with our unique Google optimized e-Paper software.
maxHeap: timp de executie<br />
inaltime (adancime) arbore = lungimea celui<br />
mai lung drum de la radacina la f<strong>ro</strong>ntiera<br />
lungime drum = numar arce<br />
n =2 k+1 -1<br />
inaltime arbore = k = log (n+1)-1<br />
operatiile inserare/eliminare necesita timpul<br />
O(inaltime abore) = O(log n)<br />
0<br />
1<br />
2<br />
3 4 5 6<br />
Dorel Lucanu<br />
Algoritmica si p<strong>ro</strong>gramare
Change language