pohlepni algoritmi

• 0Niko još nije pohvalio poruku.
  Registruj se da bi pohvalio/la poruku!

Ako neko dobro poznaje algoritme, molim za malu pomoc : u poznatom primeru vracanja kusura, koju strukturu podataka koristi algoritam i zasto ?

• 0Niko još nije pohvalio poruku.
  Registruj se da bi pohvalio/la poruku!

Mislim da je u pitanju struktura binarno stablo.

• 0Niko još nije pohvalio poruku.
  Registruj se da bi pohvalio/la poruku!

To sam i ja pretpostavljao. Hvala.

Dopuna: 20 Dec 2007 19:55

Cekaj, cekaj, nisi mi odgovorio zasto.

• 1Ovo se svidja korisniku: nradukic
  
  Registruj se da bi pohvalio/la poruku!

Citat:Associated with the binary tree is a cursor. This reference points to a current node within the tree, or it is null. When the tree is first created it is empty, with a null cursor (there is nothing to refer to). When a node is added, it is added at the location indicated by the cursor. The cursor may be moved about with the "move" methods. When the cursor "falls off" the tree at a current leaf, a new value may be added at that location.