//slim tree
binary tree:
heap: all leap have to be as left as possible, like complete tree
bst: just remeber that every node in left subtree < current node < every node in right subtree
avl: the self balancing version of bst
red and black tree: another self balancing version of bst, but less strictly balanced than avl
//fat tree
2-4 tree: a specific version of B tree. also it is more accurate to call this 2-3-4 tree because every non child node can have 2 or 3 or 4 children
B and B+ tree: B tree has a attribute called order, and the order of B-tree is defined as the maximum number of children a node can have.
the difference between avl and r&b tree:
the difference between B, B-, B+ tree:
本文章为转载内容，我们尊重原作者对文章享有的著作权。如有内容错误或侵权问题，欢迎原作者联系我们进行内容更正或删除文章。
