2-3-4 and red-black Trees
			• And, we represent a node with 3 pieces of data and 4 children as a binary search tree with red and black child pointers
																									60
																														black
																			black
				40,60,80
																				40											80
														red										red										red
	20
					50			70			90
															20								50						70							90