Help explain successor binary search tree code thanks

Expand Post »

Binary Search tree help
Can somebody explain to me what this code is doing step by step?, thanks

java Syntax (Toggle Plain Text)
TREE-SUCCESSOR(x)
if right[x] ≠ NIL
then return TREE-MINIMUM (right[x])
y ← p[x]
while y ≠ NIL and x = right[y]
do x ← y
y ← p[y]
return y
TREE-SUCCESSOR(x)
if right[x] ≠ NIL
then return TREE-MINIMUM (right[x])
y ← p[x]
while y ≠ NIL and x = right[y]
do x ← y
y ← p[y]
return y

Dio1080

Reputation Points: 10

Solved Threads: 0

Light Poster

Offline

47 posts
since Aug 2007

Permalink

Mar 24th, 2009

Re: Help explain successor binary search tree code thanks

The code you have posted is not Java.

Ezzaral

Moderator

Featured Poster

Reputation Points: 3239

Solved Threads: 838

Posting Genius

Offline

6,757 posts
since May 2007

Permalink

Mar 24th, 2009

Re: Help explain successor binary search tree code thanks

opps

Dio1080

Reputation Points: 10

Solved Threads: 0

Light Poster

Offline

47 posts
since Aug 2007

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in Java Forum Timeline: Java webstart, round 1

Next Thread in Java Forum Timeline: Question for NetBeans users

DaniWeb Message

Cancel Changes

User Name
Password