Data Structures Analysis? $(8$ pt$)$

$$

Inserting or retrieving an element in a regular BST can take up to O$(1)$ in the worst case if the tree is lopsided

$$

Using a self$-$balancing BST ensures O$($log N$)$ complexity for these operations.

Inserting or retrieving an element in a regular BST can take up to O$($log N$)$ in the worst case if the tree is lopsided

In a Binary Search Tree, each node has at most two children:

$$ Left child contains keys smaller than the parent node.

$$ Right child contains keys greater than the parent node.

Operations like insertion, search, and deletion rely on traversing the tree based on these properties.