 Adding one item to a binary search tree is on average an process (in big O notation).Adding n items is an process, making tree sorting a 'fast sort' process.Adding an item to an unbalanced binary tree requires time in the worst-case