Curs 3 - Agenda - Profs.info.uaic.ro

More documents

Recommendations

Info

Arbori binari: implementarea parcurgerii BFS procedure parcurgeBFS(t) begin if (t = NULL) then return else C ← (t) while (not esteVida(C)) citeste(C, v) viziteaza(v) elimina(C) if (v→stg ≠ NULL) then insereaza(C, v->stg) if (v→drp ≠ NULL) then insereaza(C, v->drp) end Dorel Lucanu Algoritmica si programare
Aplicatie: expresii intregi Expresii intregi • definitie • exemple Reprezentarea expresiilor ca arbori • similaritati intre cele doua definitii • arborele asociat unei expresii • notatiile pref-, in- si postfixate si parcurgeri ale arborilor Dorel Lucanu Algoritmica si programare
Page 1 and 2: Curs 3 - A
Page 3 and 4: Subprograme recursive: Fibonacci fu
Page 5 and 6: Functii recursive: conversie binara
Page 7 and 8: Functii recursive: turnurile din Ha
Page 9 and 10: Arbori binari: exemplu C E G K A M
Page 11 and 12: ArbBin: operatii insereaza() • i
Page 13 and 14: ArbBin: eliminare elimina() • in
Page 15 and 16: ArbBin :parcurgere preordine parcu
Page 17 and 18: ArbBin :parcurgere inordine parcur
Page 19 and 20: ArbBin: parcurgere postordine parc
Page 21 and 22: ArbBin: parcurgere BFS - exemplu C
Page 23 and 24: ArbBin : structura unui nod un nod
Page 25: Arbori binari: implementarea parcur
Page 29 and 30: Expresiile reprezentate ca arbori -
Page 31 and 32: Coada cu prioritati: tip de data ab
Page 33 and 34: maxHeap arbori binari completi cu
Page 35 and 36: maxHeap: inserarea 12 10 9 8 7 1 3
Page 37 and 38: maxHeap: inserare procedure inserea
Page 39 and 40: maxHeap: timp de executie inaltime
Page 41 and 42: Colectii de multimi disjuncte: “u

Curs 3 - Agenda - Profs.info.uaic.ro

You also want an ePaper? Increase the reach of your titles

Delete template?

Save as template?