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
A) Binary search tree B) AVL – tree C) Complete tree D) Threaded binary tree
a) removal of node b) incement of node c)decrement of node d) none of these
A) Dequeue B) Priority C) Tree D) Graph
a) n leaf node b) n internal nodes c) n-1 leaf nodes d) n-1 internal nodes
The number of the node in the left sub-tree and right sub-tree of the root, respectively, is a) (4, 7) b) (7, 4) c) (8, 3) d) (3, 8)
a) 2h+1 -1 b) 2h c) 2h -1 d) 2h -1
a) Internal nodes b) External nodes c) Root nodes d) None
a) Pre-order b) In-order c) Post-order d) None
a) 2, 252, 401, 398, 330, 344, 397, 363 b) 924, 220, 911, 244, 898, 258, 362, 363 c) 925, 202, 911, 240, 912, 245, 258, 363 d) 2, 399, 387, 219, 266, 382, 381, 278, 363
A. ABFCDE B. ADBFEC C. ABDECF D. ABDCEF
A. Data B. Location and left child C. Right child address D. Null value