Implement a Red-Black Tree (Conceptual)

A Red-Black Tree is a self-balancing BST ensuring O(log n) performance, critical for systems requiring deterministic latency like Tesla's autonomy stack. It maintains balance through four rules: first, the root must be black; second, all leaf nodes (null pointers) are black; third, no two consecutive red nodes exist; fourth, every path from root to leaf contains the same number of black nodes. During insertion, we add a new node as red. If this violates the parent-child red rule, we fix it using rotations and recoloring. For example, if a parent and child are both red, we might recolor the parent black and uncle red, or perform a left/right rotation to restructure the tree. Deletion is more complex; removing a black node creates a 'double black' violation. We resolve this by pushing the extra black up the tree or rotating neighbors to redistribute black nodes until the invariant holds. This ensures the tree never becomes too skewed, maintaining optimal search times even with millions of dynamic data points.