An k-ary search tree has k children per node, and k-1 keys per node. To find a value in a k-ary tree with n nodes, the maximum number of comparisons will be (k

An k-ary search tree has k children per node, and k-1 keys per node. To find a value in a k-ary tree with n nodes, the maximum number of comparisons will be (k-1)log_k(n). This is minimized when k = e.