Faster lookups, insertions, and in-order traversal than a red-black or AVL tree

		Faster lookups, insertions, and in-order traversal than a red-black or AVL tree (neosmart.net)
		2 points by ComputerGuru on June 7, 2019 \| hide \| past \| favorite