The in order traversal of tree will yield a sorted listing of elements of tree in

Related MCQs

• The post order traversal of a binary tree is DEBFCA. Find out the pre order traversal
• You want to check whether a given set of items is sorted. Which of the following sorting methods will be most efficient if it is already in sorted order?
• When in order traversing a tree resulted E A C K F H D B G; the preorder traversal would return
• Consider that n elements are to be sorted.The worst case complexity of bubble sort is____
• Consider that n elements are to be sorted. What is the worst case time complexity of Bubble sort?
• ________ is a list in which the order of the items is significant, and the items are not necessarily sorted.
• A sorting technique that guarantees that records with the same primary key occurs in the same order in the sorted list as in the original unsorted list is said to be
• When converting binary tree into extended binary tree, all the original nodes in binary tree are
• Which sorting algorithm can exploit the partially sorted data in a list?
• A sorted file contains 16 items. Using binary search, the maximum number of comparisons to search for an item in this file is