| | |
Help explain successor binary search tree code thanks
Please support our Java advertiser: Programming Forums - DaniWeb Sister Site
![]() |
Binary Search tree help
Can somebody explain to me what this code is doing step by step?, thanks
Can somebody explain to me what this code is doing step by step?, thanks
java Syntax (Toggle Plain Text)
TREE-SUCCESSOR(x) 1 if right[x] ≠ NIL 2 then return TREE-MINIMUM (right[x]) 3 y ← p[x] 4 while y ≠ NIL and x = right[y] 5 do x ← y 6 y ← p[y] 7 return y
![]() |
Other Threads in the Java Forum
- Previous Thread: Java webstart, round 1
- Next Thread: Question for NetBeans users
| Thread Tools | Search this Thread |
actuate android api applet application applications array arrays automation balls bank binary bluetooth business chat class classes clear client code codesnippet collections component database db defaultmethod development dice dragging draw ebook eclipse error event exception formatingtextintooltipjava fractal game givemetehcodez graphics gui html ide image infinite input integer invokingapacheantprogrammatically j2me java javaprojects jni jpanel julia linux list loop looping map method methods mobile mysql netbeans newbie numbers openjavafx oracle parameter php print problem program programming project recursion repositories scanner screen scrollbar server set size sms sort sorting sql sqlserver state storm string sun superclass swing swt text-file threads time tree windows






