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 must be the ideal size of array if the height of tree is 'l'?

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

In a binary search tree, which of the following traversals would print the numbers in the ascending order?

  1. A. Level-order traversal
  2. B. Pre-order traversal
  3. C. Post-order traversal
  4. D. In-order traversal
Report Error

A binary search tree contains values 7, 8, 13, 26, 35, 40, 70, 75. Which one of the following is a valid post-order sequence of the tree provided the pre-order sequence as 35, 13, 7, 8, 26, 70, 40 and 75?

  1. A. 7, 8, 26, 13, 75, 40, 70, 35
  2. B. 26, 13, 7, 8, 70, 75, 40, 35
  3. C. 7, 8, 13, 26, 35, 40, 70, 75
  4. D. 8, 7, 26, 13, 40, 75, 70, 35
Report Error

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

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

What is the speciality about the inorder traversal of a binary search tree?

  1. A. It traverses in a non increasing order
  2. B. It traverses in an increasing order
  3. C. It traverses in a random fashion
  4. D. It traverses based on priority of the node
Report Error

What is/are the disadvantages of implementing tree using normal arrays?

  1. A. difficulty in knowing children nodes of a node
  2. B. difficult in finding the parent of a node
  3. C. have to know the maximum number of nodes possible before creation of trees
  4. D. difficult to implement
Report Error

What is the time complexity of for achieving competitive ratio by tango tree?

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

General ordered tree can be encoded into binary trees.

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

Which special balanced binary search tree is used to store the nodes of auxiliary tree?

  1. A. Red - Black Tree
  2. B. Red - Brown Tree
  3. C. Red - Yellow Tree
  4. D. Red - Tango Tree
Report Error

Which of the following graph traversals closely imitates level order traversal of a binary tree?

  1. A. Depth First Search
  2. B. Breadth First Search
  3. C. Depth & Breadth First Search
  4. D. Binary Search
Report Error

What is a full binary tree?

  1. A. Each node has exactly zero or two children
  2. B. Each node has exactly two children
  3. C. All the leaves are at the same level
  4. D. Each node has exactly one or two children
Report Error

Which of the following is not an advantage of trees?

  1. A. Hierarchical structure
  2. B. Faster search
  3. C. Router algorithms
  4. D. Undo/Redo operations in a notepad
Report Error