2-3 Trees
	• Every node in a 2-3 tree is either a leaf, or has either 2 or 3 children. – So, there can be a left and right subtree for each node...or a left, middle, and right subtree. • To use a 2-3 tree for implementing our ADT table operations – we need to create the tree such that the data items are ordered. The ordering of items in a 2-3 search tree is similar to that of a binary search tree. In fact, you will see that to retrieve -- our pseudo code is very similar to that of a binary search tree.