Sign inSign in

AVL insert

The process of inserting a node into an AVL tree by first performing a standard BST insert and then fixing any AVL property violations from the changed node upwards.
Watch it explained

Know first

Named as a prerequisite by the lectures that define this. The number is how many say so. A grey one has no page yet.

AVL tree1Binary search tree insertion1Tree rotation1

Lecturers

1

    Connections

    3

    The lectures that define it or assume it, and the concepts next to it.

    Concepts2

    1 lecturer. Definitions are written by AI from each lecture’s transcript. A time with a play mark starts the lecture at the moment the lecturer says it.