Using BSTs for Table ADTs
	• We can implement our ADT Table operations using a nonlinear approach of a binary search tree. • This provides the best features of a linear implementation that we previously talked about plus you can insert and delete items without having to shift data. • With a binary search tree we are able to take advantage of dynamic memory allocation.