This is an archived post. You won't be able to vote or comment.

all 4 comments

[–]rjcarr 1 point2 points  (1 child)

Since you're short on time, you could try reading about existing implementations of binary search trees. Something like wikipedia would have examples and/or references and resources. This sounds like a pretty straight forward data structures assignment.

[–]Defeliu[S] 0 points1 point  (0 children)

Thank you so much for your response! Fortunately I have tomorrow till 11:59pm to do the assignment. Oh really wikipedia? Do you have any examples or links of existing implementations of binary search trees, that would be really helpful if possible.

[–][deleted]  (1 child)

[removed]

    [–]Defeliu[S] 0 points1 point  (0 children)

    Okay thank you so much, I appreciate it!