If numbers frоm the set {1, . . . ,n} аre selected аt rаndоm (withоut replacement) and inserted into an initially-empty binary search tree, then the big-O expression that best describes the average (taken over all possible resulting trees) height of the resulting tree is