种二叉平衡树,二叉平衡树的左旋转,右旋转
package org.structure.avlTree;
/**
* 种一棵二叉平衡树(Avl树)
* @author cjj_1
* @date 2020-09-02 13:46
*/
public class AvlTreeDemo {
public static void main(String[] args) {
// int[] arr ={4,3,6,5,7,8};
int[] arr={10,7,11,6,8,9};
AvlT
原创
2020-09-02 14:52:48 ·
95 阅读 ·
0 评论