avlTree.definition

// Java
class Node {
    int value, height;
    Node left, right;
    Node(int v) { value = v; height = 1; }
}

class AVLTree {
    Node root;

    int height(Node n) { return n == null ? 0 : n.height; }
    int balance(Node n) { return height(n.left) - height(n.right); }

    Node rightRotate(Node y) {
        Node x = y.left;
        y.left = x.right;
        x.right = y;
        y.height = 1 + Math.max(height(y.left), height(y.right));
        x.height = 1 + Math.max(height(x.left), height(x.right));
        return x;
    }
}

# Python
class Node:
    def __init__(self, value):
        self.value = value
        self.height = 1
        self.left = self.right = None

class AVLTree:
    def height(self, n):
        return n.height if n else 0

    def balance(self, n):
        return self.height(n.left) - self.height(n.right) if n else 0

    def right_rotate(self, y):
        x = y.left
        y.left = x.right
        x.right = y
        y.height = 1 + max(self.height(y.left), self.height(y.right))
        x.height = 1 + max(self.height(x.left), self.height(x.right))
        return x

// C++
struct Node {
    int value, height;
    Node *left, *right;
    Node(int v) : value(v), height(1), left(nullptr), right(nullptr) {}
};

class AVLTree {
    int height(Node* n) { return n ? n->height : 0; }
    int balance(Node* n) { return height(n->left) - height(n->right); }

    Node* rightRotate(Node* y) {
        Node* x = y->left;
        y->left = x->right;
        x->right = y;
        y->height = 1 + max(height(y->left), height(y->right));
        x->height = 1 + max(height(x->left), height(x->right));
        return x;
    }
};

// JavaScript
class Node {
  constructor(value) {
    this.value = value;
    this.height = 1;
    this.left = this.right = null;
  }
}

class AVLTree {
  height(n) { return n ? n.height : 0; }
  balance(n) { return this.height(n?.left) - this.height(n?.right); }

  rightRotate(y) {
    const x = y.left;
    y.left = x.right;
    x.right = y;
    y.height = 1 + Math.max(this.height(y.left), this.height(y.right));
    x.height = 1 + Math.max(this.height(x.left), this.height(x.right));
    return x;
  }
}