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.

How many bits would a succinct binary tree occupy?

  1. A. n+O(n)
  2. B. 2n+O(n)
  3. C. n/2
  4. D. n
Report Error

Identify the reason which doesn't play a key role to use threaded binary trees?

  1. A. The storage required by stack and queue is more
  2. B. The pointers in most of nodes of a binary tree are NULL
  3. C. It is Difficult to find a successor node
  4. D. They occupy less size
Report Error

What are the applications of weight balanced tree?

  1. A. dynamic sets, dictionaries, sequences, maps
  2. B. heaps
  3. C. sorting
  4. D. storing strings
Report Error

Which is the simplest of all binary search trees?

  1. A. AVL tree
  2. B. Treap
  3. C. Splay tree
  4. D. Binary heap
Report Error

Which of the following traversing algorithm is not used to traverse in a tree?

  1. A. Post order
  2. B. Pre order
  3. C. Post order
  4. D. Randomized
Report Error

What is an AVL tree?

  1. A. a tree which is balanced and is a height balanced tree
  2. B. a tree which is unbalanced and is a height balanced tree
  3. C. a tree with three children
  4. D. a tree with atmost 3 children
Report Error

What is a weight balanced tree?

  1. A. A binary tree that stores the sizes of subtrees in nodes
  2. B. A binary tree with an additional attribute of weight
  3. C. A height balanced binary tree
  4. D. A normal binary tree
Report Error

Which of the following data structures can be efficiently implemented using height balanced binary search tree?

  1. A. sets
  2. B. priority queue
  3. C. heap
  4. D. both sets and priority queue
Report Error

Who invented treaps?

  1. A. Cecilia and Raimund
  2. B. Arne Andersson
  3. C. Donald Shell
  4. D. Harris and Ross
Report Error

Consider the pseudo code: int avl(binarysearchtree root): if(not root) return 0 left_tree_height = avl(left_of_root) if(left_tree_height== -1) return left_tree_height right_tree_height= avl(right_of_root) if(right_tree_height==-1) return right_tree_height Does the above code can check if a binary search tree is an AVL tree?

  1. A. yes
  2. B. no
Report Error

Is tango tree represented as a tree of trees.

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

What should be the condition for the level of a left node?

  1. A. It should be less than or equal to that of its parent
  2. B. It should be greater than that of its parent
  3. C. It should be strictly less than that of its parent
  4. D. The level should be equal to one
Report Error