3 ms·Binary trees are log(n), not n*log(n)by schrodinger 11y agoBinary trees are log(n), not n*log(n)niutech 11y agoYou're right. n*log(n) is for building the BST in Tree sort.