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.

In a full binary tree if number of internal nodes is I, then number of nodes N are?

  1. A. N = 2*I
  2. B. N = I + 1
  3. C. N = I - 1
  4. D. N = 2*I + 1
Report Error

What is a threaded binary tree traversal?

  1. A. a binary tree traversal using stacks
  2. B. a binary tree traversal using queues
  3. C. a binary tree traversal using stacks and queues
  4. D. a binary tree traversal without using stacks and queues
Report Error

The minimum height of self balancing binary search tree with n nodes is . . . . . . . .

  1. A. log 2 (n)
  2. B. n
  3. C. 2n + 1
  4. D. 2n - 1
Report Error

Is mathematical randomized tree can be generated using beta distribution.

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

Which of the below diagram is following AVL tree property?

  1. A. only i
  2. B. both i and ii
  3. C. only ii
  4. D. i is not a binary search tree
Report Error

What may be the psuedo code for finding the size of a tree?

  1. A. find_size(root_node–>left_node) + 1 + find_size(root_node–>right_node)
  2. B. find_size(root_node–>left_node) + find_size(root_node–>right_node)
  3. C. find_size(root_node–>right_node) – 1
  4. D. find_size(root_node–>left_node + 1
Report Error

In the given figure, find '?'.

  1. A. left rotation
  2. B. right rotation
  3. C. insertion
  4. D. deletion
Report Error

Consider below sequences. array=60 90 10 100 40 150 90 reverse 2 to 3 array=60 10 90 100 40 150 90 reverse 3 to 6 array= 60 100 150 40 100 90 90 now printout from 1 to 6 :-- 60 100 150 40 100 90 How to achieve the above operation efficiently?

  1. A. use linked lists
  2. B. use avl trees
  3. C. use red-black trees
  4. D. use treaps (cartesian trees)
Report Error

What is the time complexity for maintaining a dynamic set of weighted trees?

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

What is the average running time of a treap?

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

Is it possible to perform a split operation on a string in the rope if the split point is in the middle of the string.

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

After which city is tango tree named?

  1. A. Vatican City
  2. B. Buenos Aires
  3. C. New York
  4. D. California
Report Error