The………pointer of header node points the root node.
A. left.
B. right.
C. null.
D. node.
ANSWER: A
The………pointer of header node points the root node. Read More »
Which of the following data structure is used in retrieval and manipulation of data stored in external memory.
A. Binary search.
B. Quick sort.
C. m-way search trees
D. Heap sort.
ANSWER: C
is the technique that is used to restore the balance of the search tree.
A. Rotations.
B. Resolutions.
C. Revolutions.
D. Recursions.
ANSWER: A
is the technique that is used to restore the balance of the search tree. Read More »
……….is the level number of the root node.
A. 1.
B. 0.
C. -1.
D. 5.
ANSWER: B
……….is the level number of the root node. Read More »
A tree T is called , if each node N in T satisfies the value at N is greater than every value in the left subtree of N and is less than the value in the right subtree of N.
A. binary search tree.
B. extended tree.
C. B-tree.
D. rooted tree.
ANSWER: A
Binary trees with special pointers namely threads are called
A. linked trees.
B. pointing trees.
C. extended trees.
D. threaded trees.
ANSWER: D
Binary trees with special pointers namely threads are called Read More »
Tree is a ___________ structure.
A. linear.
B. non-linear.
C. circular.
D. pointer.
ANSWER: B
Tree is a ___________ structure. Read More »
The following sequence of operation is performed on stack: push(1).push(2),pop.push(1).push(2),pop,pop.pop.push(2),pop. The sequence of popped out values are .
A. 2,2,1,1,2
B. 2,2,1,2,2
C. 2,1,2,2,1
D. 2,1,2,2,2
ANSWER: A
The average running time f(n) to search an item in a binary tree T with n elements is
A. O(n2).
B. O(log2n).
C. O(n).
D. O(n3).
ANSWER: B
The average running time f(n) to search an item in a binary tree T with n elements is Read More »