建立高度平衡的二叉搜索树是为了提高二叉搜索树的效率，减少树的平均搜索长度。
The highly balanced binary search tree is established in order to improve efficiency of the binary search tree and to shorten the average search tree.
给定一个升序排列的有序单链表，将其转换为一棵平衡的二叉搜索树。
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
给定一个升序排列的有序单链表，将其转换为一棵平衡的二叉搜索树。
Given a singly linked list where elements are sorted in ascending order, convert it to a height balanced BST.
应用推荐