In algorithms, for Binary Search Tree insert, one helpful thing to remember is you need to use two pointers and drill down to the right place to insert the node, the two pointers are current and [...]
Answer
parent
^^ you need the parent pointer, because by the time you drill down to current, current will be None (so addition of node has to be done via parent).
Question
In algorithms, for Binary Search Tree insert, one helpful thing to remember is you need to use two pointers and drill down to the right place to insert the node, the two pointers are current and [...]
Answer
?
Question
In algorithms, for Binary Search Tree insert, one helpful thing to remember is you need to use two pointers and drill down to the right place to insert the node, the two pointers are current and [...]
Answer
parent
^^ you need the parent pointer, because by the time you drill down to current, current will be None (so addition of node has to be done via parent).
If you want to change selection, open document below and click on "Move attachment"
pdf
owner: kkhosravi - (no access) - PYTHON_DATA_STRUCTURES_AND_ALGORITHMS.pdf, p152
Summary
status
not learned
measured difficulty
37% [default]
last interval [days]
repetition number in this series
0
memorised on
scheduled repetition
scheduled repetition interval
last repetition or drill
Details
No repetitions
Discussion
Do you want to join discussion? Click here to log in or create user.