Joined
Last Seen
-5 Reputation Points
- Strength to Increase Rep
- +0
- Strength to Decrease Rep
- -0
0% Quality Score
- Upvotes Received
- 0
- Posts with Upvotes
- 0
- Upvoting Members
- 0
- Downvotes Received
- 3
- Posts with Downvotes
- 1
- Downvoting Members
- 3
0 Endorsements
Ranked #107.65K
~263 People Reached
Favorite Forums
Favorite Tags
1 Posted Topic
Hi , the comments describe the code in a better way. our job is to find the successor. [QUOTE=Dio1080;831950]Binary Search tree help Can somebody explain to me what this code is doing step by step?, thanks [CODE=Java] TREE-SUCCESSOR(x) 1 if right[x] ≠ NIL 2 then return TREE-MINIMUM (right[x]) // if …
The End.
mailmarwa