BSTree::getPredecessor
Da li u ovoj metodi,
ako zadati cvor r nema levog sina,
treba pogledati da li je r desni sin svoga oca pa onda vratiti oca cvora r
kao prethodnika ili se gleda samo podstablo cvora r u potrazi za
prethodnikom?
--
Sinisa Rudan
--------------------------------------------------------------------------
Associate editor of multimedia part of InfoM Journal,
Journal of Information technology and multimedia systems.
http://www.infoM.org.yu
MAGIC WAND solutions * Studio
founder and owner
http://www.MagicWandSolutions.com
http://galeb.etf.bg.ac.yu/~sir
--------------------------------------------------------------------------
ako zadati cvor r nema levog sina,
treba pogledati da li je r desni sin svoga oca pa onda vratiti oca cvora r
kao prethodnika ili se gleda samo podstablo cvora r u potrazi za
prethodnikom?
--
Sinisa Rudan
--------------------------------------------------------------------------
Associate editor of multimedia part of InfoM Journal,
Journal of Information technology and multimedia systems.
http://www.infoM.org.yu
MAGIC WAND solutions * Studio
founder and owner
http://www.MagicWandSolutions.com
http://galeb.etf.bg.ac.yu/~sir
--------------------------------------------------------------------------
- Follow-Ups:
- Re: BSTree::getPredecessor
- From: "Milos Djokovic" <mdjokovic@gmail.com>
- Re: BSTree::getPredecessor
Previous by date: Re: Struktura direktorijuma u predaji - hitno
Next by date: Re: orphaned case
Previous by thread: Re: Struktura direktorijuma u predaji - hitno Next by thread: Re: BSTree::getPredecessor
Previous by thread: Re: Struktura direktorijuma u predaji - hitno Next by thread: Re: BSTree::getPredecessor