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.

The size value of various nodes in a weight balanced tree are leaf - zero internal node - size of it's two children is this true?

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

What is the possible number of binary trees that can be created with 3 nodes, giving the sequence N, M, L when traversed in post-order.

  1. A. 15
  2. B. 3
  3. C. 5
  4. D. 8
Report Error

What operation does the following diagram depict?

  1. A. inserting a leaf node
  2. B. inserting an internal node
  3. C. deleting a node with 0 or 1 child
  4. D. deleting a node with 2 children
Report Error

Binary tree sort implemented using a self balancing binary search tree takes O(n log n) time in the worst case but still it is slower than merge sort.

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

The steps for finding post-order traversal are traverse the right subtree, traverse the left subtree or visit the current node.

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

The following given tree is an example for?

  1. A. Binary tree
  2. B. Binary search tree
  3. C. Fibonacci tree
  4. D. AVL tree
Report Error

What is a splay operation?

  1. A. moving parent node to down of child
  2. B. moving a node to root
  3. C. moving root to leaf
  4. D. removing leaf node
Report Error

Which of the following property of splay tree is correct?

  1. A. it holds probability usage of the respective sub trees
  2. B. any sequence of j operations starting from an empty tree with h nodes atmost, takes O(jlogh) time complexity
  3. C. sequence of operations with h nodes can take O(logh) time complexity
  4. D. splay trees are unstable trees
Report Error

What are the conditions for an optimal binary search tree and what is its advantage?

  1. A. The tree should not be modified and you should know how often the keys are accessed, it improves the lookup cost
  2. B. You should know the frequency of access of the keys, improves the lookup time
  3. C. The tree can be modified and you should know the number of elements in the tree before hand, it improves the deletion time
  4. D. The tree should be just modified and improves the lookup time
Report Error

A binary tree is balanced if the difference between left and right subtree of every node is not more than . . . . . . . .

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

Which type of binary search tree is imitated for construction of tango tree?

  1. A. Complete Binary Search Tree
  2. B. Perfect Binary Search Tree
  3. C. Balanced Binary Search Tree
  4. D. Degenerate Binary Search Tree
Report Error

Consider the following data. The pre order traversal of a binary tree is A, B, E, C, D. The in order traversal of the same binary tree is B, E, A, D, C. The level order sequence for the binary tree is . . . . . . . .

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