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.

Which of the following is false about a binary search tree?

  1. A. The left child is always lesser than its parent
  2. B. The right child is always greater than its parent
  3. C. The left and right sub-trees should also be binary search trees
  4. D. In order sequence gives decreasing order of elements
Report Error

What are the operations that can be performed on weight balanced tree?

  1. A. all basic operations and set intersection, set union and subset test
  2. B. all basic operations
  3. C. set intersection, set union and subset test
  4. D. only insertion and deletion
Report Error

Associative arrays can be implemented using . . . . . . . .

  1. A. B-tree
  2. B. A doubly linked list
  3. C. A single linked list
  4. D. A self balancing binary search tree
Report Error

What is the time complexity for deleting the string to form a new string in the rope data structure?

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

The average depth of a binary tree is given as?

  1. A. O(N)
  2. B. O(√N)
  3. C. O(N 2 )
  4. D. O(log N)
Report Error

What is the parent for a node 'w' of a complete binary tree in an array representation when w is not 0?

  1. A. floor(w-1/2)
  2. B. ceil(w-1/2)
  3. C. w-1/2
  4. D. w/2
Report Error

When we have red-black trees and AVL trees that can perform most of operations in logarithmic times, then what is the need for splay trees?

  1. A. no there is no special usage
  2. B. In real time it is estimated that 80% access is only to 20% data, hence most used ones must be easily available
  3. C. redblack and avl are not upto mark
  4. D. they are just another type of self balancing binary search trees
Report Error

Is Top tree used for maintaining Dynamic set of trees called forest.

  1. A. True
  2. B. False
Report Error

What is the reason behind the simplicity of a treap?

  1. A. Each node has data and a pointer
  2. B. Each node is colored accordingly
  3. C. It is a binary search tree following heap principles
  4. D. Each node has a fixed priority field
Report Error

What are the disadvantages of normal binary tree traversals?

  1. A. there are many pointers which are null and thus useless
  2. B. there is no traversal which is efficient
  3. C. complexity in implementing
  4. D. improper traversals
Report Error

How many common operations are performed in a binary tree?

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

Which data structure is used to maintain a dynamic forest using a link or cut operation?

  1. A. Top Tree
  2. B. Array
  3. C. Linked List
  4. D. Stack
Report Error