B-Tree vs AVL Tree vs Red-Black Tree Performance Comparison

B-Tree vs AVL Tree vs Red-Black Tree Performance Comparison: a task in Terminal-Lego-15k (Harbor dataset). You are tasked with implementing and benchmarking three self-balancing tree data structures to empirically compare their performance characteristics: B-Tree , AVL Tree , and Red-Black Tree .