判断题：Turnpike reconstruction

For the Turnpike reconstruction algorithm of $N$ points, assuming that the distance set $D$ is maintained as an AVL tree, the running time is $O(N^2\log{N})$ if no backtracking happens.


答案：TRUE