摘要： source address：http://en.wikipedia.org/wiki/Radix_treeIncomputer science, aradixtree(alsopatriciatrieorradix trieorcompactprefix tree) is a space-optimizedtriedata structurewhere each node with only one child is merged with its child. The result is that every internal node has up to the number of ch 阅读全文

摘要： source address：http://en.wikipedia.org/wiki/Red%E2%80%93black_treeAred–black treeis a type ofself-balancing binary search tree, adata structureused incomputer science.The self-balancing is provided by painting each node with one of two colors (these are typically called 'red' and 'black& 阅读全文