(A) Two entries are identical except for their keys
(B) Two entries with different data have the exact same key
(C) Two entries with different keys have the same exact hash value
(D) Two entries with the exact same key have different hash values
Category: Data Structures Mcqs
Data Structures Mcqs for Screening tests, Interviews, Viva and Other competitive exams. Data Structures Mcqs section will help users to prepare mcqs of Data Structures for various exams. Aspirants of Lecturer Computer Science, SST Computer Science, Subject Specialist Computer Science, Data Entry operator, Computer Programmer, Computer Operator, System administrator and all other Exams can prepare their Data Structures portion from here.
If the bottom level of a binary tree is NOT completely filled, depicts that the tree is NOT a?
(A) Threaded binary tree
(B) Expression tree
(C) Complete Binary tree
(D) Perfectly complete Binary tree
We convert the __ pointers of binary to threads in threaded binary tree.
(A) Right
(B) Left
(C) NULL
(D) None of the above
If one pointer of the node in a binary tree is NULL then it will be a/an?
(A) External node
(B) Root node
(C) Leaf node
(D) Inner node
Merge sort and quick sort both fall into the same category of sorting algorithms. What is this category?
(A) O(nlogn) sorts
(B) Interchange sort
(C) Average time is quadratic
(D) None of the above
If there are N elements in an array then the number of maximum steps needed to find an element using Binary Search is?
(A) N^2
(B) N
(C) Nlog2N
(D) log2N
The easiest case of deleting a node from BST is the case in which the node to be deleted?
(A) Is a leaf node
(B) Has right subtree only
(C) Has left subtree only
(D) Has both left and right subtree
A binary tree of N nodes has?
(A) Log10 N levels
(B) Log2 N levels
(C) N / 2 levels
(D) N x 2 levels