| | |
Help explain successor binary search tree code
Please support our C++ advertiser: Intel Parallel Studio Home
![]() |
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 C++ Forum
- Previous Thread: Never-ending loop. Help please.
- Next Thread: highest and lowest value ? Please help me
| Thread Tools | Search this Thread |
api array arrays based binary bitmap c++ c/c++ calculator char char* class classes code coding compile compiler console conversion convert count data database delete deploy developer dll download dynamic dynamiccharacterarray email encryption error file forms fstream function functions game generator getline givemetehcodez graph gui homeworkhelp iamthwee ifstream input int java lib linkedlist linker list loop looping loops map math matrix memory multiple news node number numbertoword output pointer problem program programming project python random read recursion recursive reference rpg sorting string strings temperature template test text text-file tree url variable vector video visual visualstudio win32 windows winsock word wordfrequency wxwidgets






