In this paper we study the Kolmogorov Complexity of a Binary Insertion Tree. We obtain a simple incompressibility argument that yields an asymptotic analysis of average tree height. This argument further implies that the QuickSort algorithm sorts a permutation of n elements in Ɵ (n log n) comparisons on average.