... Fundamental Algorithms Other books you might consult for more information include Data Structures with C++, by Ford and Topp (1996), and, if you’re interested in Java implementations (and you should ... more fundamental structures, such as arrays and linked lists, because you can search a binary tree quickly (as opposed to a linked list) and you can quickly insert data and delete data from a binary ... unbalanced and the search algorithms will not work as well EXERCISES Write a program that generates 10,000 random integers in the range of 0–9 and stores them in a binary search tree Using one of the algorithms...