a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.
A063090
a(n)/(n*n!) is the average number of comparisons needed to find a node in a binary search tree containing n nodes inserted in a random order.
Terms
- a(0) =1a(1) =6a(2) =34a(3) =212a(4) =1488a(5) =11736a(6) =103248a(7) =1004832a(8) =10733760a(9) =124966080a(10) =1575797760a(11) =21403457280a(12) =311623441920
External references
- oeis: A063090