[so] Tema 2: bonus ?

[Alexandru Mosoi]

Nu, dar ma bucur ca ai ales o alta solutie.

2008/5/23 Mihai Danilescu <danilescu.mihai at yahoo.com>:

> Primesc si eu un bonus daca adaptez tema 2 la operatii cu arbori de cautare
> memorati ca noduri inlantuite si nu ca vector parinte-fiu? Daca da, cat?
> Asta ar fi probabil cea de-a doua varianta, mai dificila.
>
>
>
>
> _______________________________________________
> so mailing list
> so at cursuri.cs.pub.ro
> http://cursuri.cs.pub.ro/cgi-bin/mailman/listinfo/so
>



-- 
Alexandru Moşoi
http://alexandru.mosoi.googlepages.com

Please avoid sending me Word or PowerPoint attachments.
See http://www.gnu.org/philosophy/no-word-attachments.html
-------------- next part --------------
An HTML attachment was scrubbed...
URL: http://cursuri.cs.pub.ro/pipermail/so/attachments/20080523/6cf65a7c/attachment.htm