[so] Algoritm de stergere

[Alexandru Mosoi]

On Nov 15, 2007 8:22 PM, Vlad Cananau <vladk2k at gmail.com> wrote:
>
> On Nov 15, 2007 8:20 PM, Mihai Borobocea <mihaiborobocea at gmail.com> wrote:
> > Stergi 30, si 'aduci' in locul lui succesorul.
> > Rezultatul:
> >
> >   20
> >   /  \
> >  10  35
> >     /
> >   25
> >
> >
> >
> >
> > On Nov 15, 2007 8:10 PM, Vlad Cananau < vladk2k at gmail.com> wrote:
> > > In enunt zice asa: "Pentru stergerea unui nod din arbore se va folosi
> > > varianta de algoritm care sterge SUCCESORUL, daca nodul are ambii fii."
> > > Asta ce inseamna, mai exact, ca nu se sterge nodul curent?
> > >  daca am urmatorul arbore
> > >   20
> > >   /  \
> > > 10  30
> > >     /  \
> > >   25  35
> > >
> > > si se cere stergerea lui 30, se sterge SUCCESORUL, adica 35?
> >
> >
>
> ok, si cu formularea din enunt cum ramane?
:) e un wiki... poti oricand sa imbunatatesti formulare


> --
> ___
> Vlad Cananau
> _______________________________________________
> 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