What is the worst case time complexity of the binary tree sort?

What is the worst case time complexity of the binary tree sort? Correct Answer O(n2)

For the binary tree sort the worst case when the BST constructed is unbalanced. BST gets unbalanced when the elements are already sorted. So, in the worst case, O(n2) time is required to built the BST and O(n) time to traverse the tree. Therefore, the worst case time complexity is O(n2) + O(n) = O(n2).
Bissoy MCQ

Related Questions

Which of the following is/are correct about a strictly binary tree? A. A binary tree is called strictly binary tree if every non-­leaf node of it has non empty left and right sub tree B. In strictly binary tree can have two children or no child C. A strictly binary tree with n leaves always contact 2n­-1 nodes
The worst case time complexity of insertion sort is O(n2). What will be the worst case time complexity of insertion sort if the correct position for inserting element is calculated using binary search?
Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.
We create a binary search tree B1 by inserting the numbers 1, 2, 3, 4, 5 into an empty binary search tree. We create another binary search tree B2 by inserting the numbers into an empty binary search tree in the reverse order. What is the difference between the right-most element of B1 and the left-most element of B2?
Consider a full binary tree with n internal nodes, internal path length i, and external path length e. The internal path length of a full binary tree is the sum, taken over all nodes of the tree, of the depth of each node. Similarly, the external path length is the sum, taken over all leaves of the tree, of the depth of each leaf. Which of the following is correct for the full binary tree?
The worst case time complexity of tree sort remains unaffected when implemented with an unbalanced tree or a balanced tree.
The binary tree sort implemented using a self – balancing binary search tree takes ______ time is worst case.
Consider the pseudocode given below. The function DoSomething() takes as argument a pointer to the root of an arbitrary tree represented by the leftMostChild-rightSibling representation. Each node of the tree is of type treeNode. typedef struct treeNode* treeptr; struct treeNode {              treeptr leftMostChild, rightSibling; }; int DoSomething (treeptr tree) {              int value=0;              if (tree != NULL) {              if (tree->leftMostChild == NULL)              value = 1;    else               value = DoSomething(tree->leftMostChild);               value = value + DoSomething(tree->rightSibling);     }               return(value); } When the pointer to the root of a tree is passed as the argument to DoSomething, the value returned by the function corresponds to the 
In the following question, there are six parts marked S1, S6, P, Q, R and S. The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q) Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S) He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.
In the following question, there are six parts marked S1, S6, P, Q, R and S.The position of S1 and S6 are fixed. Some parts of the sentence have been jumbled up. Rearrange these parts and choose the proper sequence from the given options. (S1) Once upon a time, there lived a farmer in a village, beside a forest. (P) When the farmer was a little boy, he spent much of his time playing with the apple tree (Q)Those days, the apple tree had given the choicest of apples to him (R) However, as time passed, the apple tree became old and stopped bearing fruits (S)He had a big garden that had an old apple tree and other plants, trees and beautiful flowers (S6) Now that the farmer was not getting any apples from the tree, he decided that the tree was useless and cut it.