This project consists of an implementation of a Binary Search Tree data structure. The goal is to implement my learnings and apply my attained knowledge through the development of a robust and efficient data structure.
10, 45, 23, 12, 34, 67, 89, 99
10
99
45, 23, 12, 34, 67, 89, 99
34, 23, 12, 67, 89, 99
34, 23, 67, 89, 99
Number does not exist
34, 23, 67, 89, 99
23
99
67
Number does not exist
23
99
23, 34, 67, 89, 99
99, 89, 67, 34, 23