Algoritm 1

Algorithm Algo(nod, dist, val, x)
  If nod = null then
    val ← 0
    x ← 0
    Return
  EndIf
  valSt ← 0, maxSt ← 0
  valDr ← 0, maxDr ← 0
  If nod.st ≠ null then
    Algo(nod.st, dist, valSt, maxSt)
  EndIf
  If nod.dr ≠ null then
    Algo(nod.dr, dist, valDr, maxDr)
  EndIf
  If nod.st ≠ null AND nod.dr ≠ null then
    If (valSt − valDr ≤ dist) AND (valDr − valSt ≤ dist) then
      If maxSt > maxDr then
        nod.val ← valSt
      Else
        nod.val ← valDr
      EndIf
    Else
      min ← 0
      If valSt < valDr then
        min ← valSt
      Else
        min ← valDr
      EndIf
      nod.val ← min
    EndIf
    max ← 0
    If maxSt > maxDr then
      max ← maxSt
    Else
      max ← maxDr
    EndIf
    x ← max + 1
    val ← nod.val
  Else
    val ← nod.val
    x ← 1
  EndIf
EndAlgorithm