This homework is about a plain, not-balanced Binary Search Tree data structure. It provides methods to insert and remove integers, test if the tree contains a given value, and retrieve the size and ...

The objective of this course is to introduce students to data structures (linked lists, binary search trees, hash tables), Abstract Data Types (Stacks, Queues, Maps, Sets, Graphs), algorithms (sorting ...