Discuss B-Trees
	• In a 2-3 tree, – if a node has 3 children then it must contain two key values. – These two values separate the key values in the node's three child subtrees. – All of the key values in the left subtree are less than the node's smaller key value; – all of the key values in the middle subtree are between the node's two key values; – all of the key values in the right subtree are greater than or equal to the node's larger key