2003 Fall / 화일처리 / 이석호 교수님 /** AVL Tree zzun hello82@unitel.co.kr http://zzun.net **/ #include struct node // AVL tree node { int data; // data type is integer struct node * left; // left subtree struct node * right; // right subtree int height; // height of the tree }; struct node * root = NULL; // root node, initially NULL void print_tree_level_order(struct node* tree, int length) // print tre..