// node structure for a binary search tree
struct node {
int data;
int height;
struct node * left;
struct node * right;
} ;
// inserts key k into an avl tree t
struct node * insertavl( struct node * t, int k) ;
// deletes key k from avl tree t
struct node * deleteavl( struct node * t, int k) ;
Ly8gbm9kZSBzdHJ1Y3R1cmUgZm9yIGEgYmluYXJ5IHNlYXJjaCB0cmVlCnN0cnVjdCBub2RlIHsKICAgaW50IGRhdGE7CiAgIGludCBoZWlnaHQ7CiAgIHN0cnVjdCBub2RlICpsZWZ0OwogICBzdHJ1Y3Qgbm9kZSAqcmlnaHQ7Cn07CiAKLy8gaW5zZXJ0cyBrZXkgayBpbnRvIGFuIGF2bCB0cmVlIHQKc3RydWN0IG5vZGUgKiBpbnNlcnRhdmwoc3RydWN0IG5vZGUgKnQsIGludCBrKTsKIAovLyBkZWxldGVzIGtleSBrIGZyb20gYXZsIHRyZWUgdApzdHJ1Y3Qgbm9kZSAqIGRlbGV0ZWF2bChzdHJ1Y3Qgbm9kZSAqdCwgaW50IGspOw==