二分查找函数模板及测试程序，它能实现查找方式中的二分查找，党查找失败时返回-1！-Binary search function template and test procedures, it can find ways to implement binary search, the party returns-1 lookup failed!

n computer science, an AVL tree is a self-balancing binary search tree, and it was the first such data structure to be invented.[1] In an AVL tree, the heights of the two child subtrees of any node differ by at most one if at any time they differ by

Binary Search Tree Java based demonstration on Canvas using AJAX for communication between browser and server