| | |
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 |
Tag cloud for C++
api application array arrays based beginner binary bmp c++ c/c++ calculator char char* class classes code compile compiler console conversion convert count data delete deploy dll download dynamic dynamiccharacterarray encryption error file format forms fstream function functions game givemetehcodez graph gui homeworkhelp iamthwee ifstream input int java lib library linkedlist linker list loop looping loops map math matrix memory microsoft newbie news number numbertoword output pointer problem program programming project python random read recursion recursive reference rpg simple sorting string strings temperature template templates test text text-file tree url variable vector video visual visualstudio void win32 windows winsock wordfrequency wxwidgets






