搜索二叉树的STL实现。包含树的前序、中序、后序遍历。-STL binary tree search implementation.

一个二叉树算法的MAP的template，使用与分配内存，经测试（顺序插入256万条数据）效率比STL高5倍。乱序插入256万条数据，是stl的2倍。-A B-Tree Map template,It 5 times faster than the stl::Map.(Test insert 2.56M datas in sequential order. 2 times faster in random order.)

一个有关stl操作的程序，实现了平衡二叉树，还有相关的数据结构，供大家学习-A related stl operating procedures, to achieve a balanced binary tree, as well as associated data structures for them to learn