最优查找二叉树和红黑树算法，可调整数据输入规模，打印树结构和总权值-Find the optimal binary tree and red-black tree algorithm, adjust the scale of data entry, printing tree structure and the total weight

基于二叉查找树进行优化，进而可以得到其他的树表查找算法，如平衡树、红黑树等高效算法(Based on the two fork search tree, we can optimize other tree table lookup algorithms, such as balanced tree, red black tree and other efficient algorithms.)