Welcome to Scribd, the world's digital library. Read, publish, and share books and documents. See more
Download
Standard view
Full view
of .
Save to My Library
Look up keyword or section
Like this
1Activity

Table Of Contents

1.1. adaugarea primului element presupune parcurgerea urmatoarelor etape:
1.2.1. înaintea primului element:
1.2.2. dupa ultimul element:
1.2.3. dupa elementul p^:
1.2.4. înaintea elementului p^:
2.1. ALGORITMUL LUI KRUSKAL
2.2. ALGORITMUL LUI PRIM
3.1. REPREZENTAREA ARBORILOR BINARI
3.2. CREAREA SI TRAVERSAREA UNUI ARBORE BINAR
3.3. APLICATII ALE ARBORILOR BINARI
4.1. ALGORITMUL LUI DIJKSTRA
4.2. ALGORITMUL LUI ROY-FLOYD
5. Stergerea elementului minim dintr-o lista ( LISTA SIMPLU ÎNLANTUITA ):
6. Forma poloneza a expresiilor aritmetice:
7. Ioan Tomescu
8. Tudor Sorin
0 of .
Results for:
No results containing your search query
P. 1
Pascal

Pascal

Ratings: (0)|Views: 15 |Likes:
Published by Bobe Danut

More info:

Published by: Bobe Danut on Jun 07, 2013
Copyright:Attribution Non-commercial

Availability:

Read on Scribd mobile: iPhone, iPad and Android.
download as PDF, TXT or read online from Scribd
See more
See less

03/17/2014

pdf

text

original

You're Reading a Free Preview
Pages 4 to 40 are not shown in this preview.
You're Reading a Free Preview
Pages 44 to 95 are not shown in this preview.
You're Reading a Free Preview
Pages 99 to 113 are not shown in this preview.

You're Reading a Free Preview

Download
/*********** DO NOT ALTER ANYTHING BELOW THIS LINE ! ************/ var s_code=s.t();if(s_code)document.write(s_code)//-->