Average-case analysis of QuickSort and Binary Insertion Tree height using incompressibility