BST的平衡查找树 C ++实现所需的高效率平衡查找树-BST balanced Find tree C++ to achieve the required high efficiency balanced search tree

关于二叉树的插入，先序遍历，后序遍历，中序遍历，叶子节点个数，树的深度，路径查找。-Binary tree insertion, preorder, postorder traversal, preorder, the number of leaf nodes, the depth of the tree, the path to find.

实现二叉树的一些功能，如建立二叉树，查找，-Achieve binary tree features, such as creating a binary tree, find,