2008/4/2 Alexandru Popescu <<a href="mailto:popescu.alex@gmail.com">popescu.alex@gmail.com</a>>:<br><div class="gmail_quote"><blockquote class="gmail_quote" style="border-left: 1px solid rgb(204, 204, 204); margin: 0pt 0pt 0pt 0.8ex; padding-left: 1ex;">
"Pentru stergerea unui nod din arbore se va folosi varianta de algoritm care sterge <b>SUCCESORUL</b>, daca nodul are ambii fii."<br>ok, probabil ca sunt eu neinitiat in lucrul cu arborii binari... dar care este acest algoritm?<br>
eventual un link edificator ar fi de miloane ;)<br clear="all"><font color="#888888"><br>-- <br>"I want to know God's thoughts; the rest are details."
</font><br>_______________________________________________<br>
so mailing list<br>
<a href="mailto:so@cursuri.cs.pub.ro">so@cursuri.cs.pub.ro</a><br>
<a href="http://cursuri.cs.pub.ro/cgi-bin/mailman/listinfo/so" target="_blank">http://cursuri.cs.pub.ro/cgi-bin/mailman/listinfo/so</a><br>
<br></blockquote></div><br>Vezi capitolul "Deletion":<br><a href="http://en.wikipedia.org/wiki/Binary_search_tree">http://en.wikipedia.org/wiki/Binary_search_tree</a><br clear="all"><br>-- <br>Please avoid sending me Word or PowerPoint attachments.<br>
See <a href="http://www.gnu.org/philosophy/no-word-attachments.html">http://www.gnu.org/philosophy/no-word-attachments.html</a><br><br>Vlad Ureche