Recent Posts
CODING HELP NEEDED
v0YclP
No.502123
I am trying to implement Binary Search Tree in pure C. i have two pathways to decide from:
>insertAtNode() which just inserts at any given node regardless of whether it already has a subtree or not
>insertList() whose responsibility is to check if a node is a leaf node or not, and THEN call insertAtNode()
OR
>insertAtNode() goes through every node until it finds a leaf node, and inserts value there
>insertList() which just calls insertAtNode() multiple times, of course, with some minor checks
which one is correct bros ? i feel like the first one is correct, but i don't know.
v0YclP
No.502131
bump please help then i'll go away
v0YclP
No.502215
bump
v0YclP
No.502239
bump
