For the AVL tree or the Red Black tree, the implementation of the get methods is exactly the same as for an ordinary (unbalanced) binary search tree.

The put and delete methods that modify the tree need some additional code to handle the balancing.

For example, for the put method, going down the tree (searching) and creating a new Node when the null link is found is also exactly like the ordinary unbalanced binary search tree code.

Returning back up the tree and attaching the modified subtree is where code needs to be inserted to check if the addition to the subtree requires rebalancing.

This rebalancing code may take place at each node on the way back up the tree and so the effect on execution time depends on this code being fast, e.g., O(1).