Binary_Search_Tree_Algorithms_Flashcards

Each node has at most two children; the left child contains smaller values, the right child contains larger values.

It allows efficient searching, insertion, and deletion with average time complexity of O(log n) if balanced.

BST uses node comparisons and has average O(log n) complexity; array search is linear (O(n)) unless it’s a binary search on a sorted array.

Compare the value to the current node, go left if smaller or right if larger, and repeat until an empty position is found.

Handle three cases: node has no children (remove directly), one child (replace with child), or two children (replace with in-order successor or predecessor).