Implement Binary Search Tree

[levyjonathan31]

Description

Implement a Binary Search Tree class that inherits from the already implemented nary Tree class.

TODO

• Each node has at most 2 children per node
• Values to the left of any given node must be less than the value of that node
• Values to the right of any given node must be greater than the value of that node
• Insertion begins by comparing the value at root node and traverses down the tree

[trumanjmoore]

Im in SWE and looking for an issue to use, is this available?

[levyjonathan31]

Im in SWE and looking for an issue to use, is this available?

It is available however I do not recommend it for the intro to SWE assignment, especially if you are unfamiliar with the Manim library.

[trumanjmoore]

Understood, thank you