officerpath@gmail.com Hyderabad, Pakistan
Login Register
Latest Jobs CSS 2025 PMS CCE Sindh FPSC PPSC MCQs Past Papers Current Affairs Scholarships Admissions Downloads Roll No. Slips Results
Commerce

Binary Search TreesB Tree MCQs

Practice Binary Search TreesB Tree MCQs for competitive exams.

Binary Search TreesB Tree MCQs

Practice questions from this topic.

What are the children for node 'w' of a complete-binary tree in an array representation?

  1. A. 2w and 2w+1
  2. B. 2+w and 2-w
  3. C. w+1/2 and w/2
  4. D. w-1/2 and w+1/2
Report Error

What is the time complexity for finding the node at x position where n is the length of the rope?

  1. A. O (log n)
  2. B. O (n!)
  3. C. O (n 2 )
  4. D. O (1)
Report Error

What are splay trees?

  1. A. self adjusting binary search trees
  2. B. self adjusting binary trees
  3. C. a tree with strings
  4. D. a tree with probability distributions
Report Error

After the insertion operation, is the resultant tree a splay tee?

  1. A. true
  2. B. false
Report Error

The pre-order and in-order are traversals of a binary tree are T M L N P O Q and L M N T O P Q. Which of following is post-order traversal of the tree?

  1. A. L N M O Q P T
  2. B. N M O P O L T
  3. C. L M N O P Q T
  4. D. O P L M N Q T
Report Error

Which property makes top tree a binary tree?

  1. A. Nodes as Cluster
  2. B. Leaves as Edges
  3. C. Root is Tree Itself
  4. D. All of the mentioned
Report Error

The number of edges from the node to the deepest leaf is called . . . . . . . . of the tree.

  1. A. Height
  2. B. Depth
  3. C. Length
  4. D. Width
Report Error

Why Red-black trees are preferred over hash tables though hash tables have constant time complexity?

  1. A. no they are not preferred
  2. B. because of resizing issues of hash table and better ordering in redblack trees
  3. C. because they can be implemented using trees
  4. D. because they are balanced
Report Error

Consider the following data and specify which one is Preorder Traversal Sequence, Inorder and Postorder sequences. S1: N, M, P, O, Q S2: N, P, Q, O, M S3: M, N, O, P, Q

  1. A. S1 is preorder, S2 is inorder and S3 is postorder
  2. B. S1 is inorder, S2 is preorder and S3 is postorder
  3. C. S1 is inorder, S2 is postorder and S3 is preorder
  4. D. S1 is postorder, S2 is inorder and S3 is preorder
Report Error

Which of the following is a self - balancing binary search tree?

  1. A. 2-3 tree
  2. B. Threaded binary tree
  3. C. AA tree
  4. D. Treap
Report Error

How many edges are present in path cluster?

  1. A. 2
  2. B. 3
  3. C. 6
  4. D. 1
Report Error

Which of the following is not a random tree?

  1. A. Treap
  2. B. Random Binary Tree
  3. C. Uniform Spanning Tree
  4. D. AVL Tree
Report Error