Sign inSign in

BST node insertion

Inserting a node into a Binary Search Tree involves traversing down the tree following search logic until hitting an open child slot where the node is placed.
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.

Binary search tree structure1BST search operation1

Lecturers

1

    Connections

    1

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

    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.