3 ms·You're right. n*log(n) is for building the BST in Tree sort.by niutech 11y agoYou're right. n*log(n) is for building the BST in Tree sort.