HARD
HSSC Clerk
IMPORTANT
Earn 100
The number of swappings needed to sort the numbers 8, 22, 7, 9, 31, 19, 5, 13 in ascending order, using bubble sort is.
50% studentsanswered this correctly
Important Questions on Data Structures
HARD
HSSC Clerk
IMPORTANT
A binary tree in which every non-leaf node has non-empty left and right subtrees is called a strictly binary tree. Such a tree with leaves:
HARD
HSSC Clerk
IMPORTANT
Preorder is nothing but _____.
HARD
HSSC Clerk
IMPORTANT
Which of the following traversal techniques lists the nodes of a binary search tree in ascending order?
HARD
HSSC Clerk
IMPORTANT
There are different algorithms to solve a given problem with the order respectively. Which is the best algorithm?
HARD
HSSC Clerk
IMPORTANT
The number of possible binary trees with nodes are _____.
HARD
HSSC Clerk
IMPORTANT
Sorting is useful for _____.
HARD
HSSC Clerk
IMPORTANT
Choose the correct statements.
HARD
HSSC Clerk
IMPORTANT
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 _____.
