In linked list each node contain minimum of two fields. One field is data field to store the data second field is?
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node
a) Pointer to character b) Pointer to integer c) Pointer to node d) Node
a) Binary trees b) Scheduling of processes c) Caching d) Spatial locality
a) 3 b) 4 c) 2 d) 1
a) Child b) First c) Root d) Parent
a) Zero b) Two c) One d) Three
a) log (n) where n is the number of nodes b) n where n is the number of nodes c) 0 or 1 d) atmost 1
a) Float b) Decimal c) Binary d) Char
(a) LinkList (b) Stack (c) Queue (d) Tree
a) 0 b) +1 C) -1 D) 2
a) LL, RL and LR, RR b) LL, RR and LR, RL c) LR, RR and LL, RL d) LR, RL and LR, RL
a) 0,1 or –1 b) –2,–1 or 0 c) 0,1 or 2 d) All the above
A) AVL tree B) Red-black tree C) Lemma tree D) None of the above
a) no rotation is needed. b) a single rotation between some node and its left child is performed. c) a single rotation between some node and its right child is performed. d) a double rotation with a node,its left child, …
Read more →
A. Binary tree B. Red black tree C. Splay tree D. AVL tree
A. Insertion B. Deletion C. Updation D. Retrival