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.

Who is the inventor of AA-Tree?

  1. A. Arne Andersson
  2. B. Daniel Sleator
  3. C. Rudolf Bayer
  4. D. Jon Louis Bentley
Report Error

Which process forms the randomized binary search tree?

  1. A. Stochastic Process
  2. B. Branching Process
  3. C. Diffusion Process
  4. D. Aggregation Process
Report Error

Of the following rules that are followed by an AA-tree, which of the following is incorrect? 1. Only right children can be red 2. Procedures are coded recursively 3. Instead of storing colors, the level of a node is stored 4. There should not be any left children

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

In postorder traversal of binary tree right subtree is traversed before visiting root.

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

What is the traversal strategy used in the binary tree?

  1. A. depth-first traversal
  2. B. breadth-first traversal
  3. C. random traversal
  4. D. Priority traversal
Report Error

What happens if we apply the below operations on an input sequence? i. construct a cartesian tree for input sequence ii. put the root element of above tree in a priority queue iii. if( priority queue is not empty) then iv. search and delete minimum value in priority queue v. add that to output vi. add cartesian tree children of above node to priority queue

  1. A. constructs a cartesian tree
  2. B. sorts the input sequence
  3. C. does nothing
  4. D. produces some random output
Report Error

What are the worst case and average case complexities of a binary search tree?

  1. A. O(n), O(n)
  2. B. O(logn), O(logn)
  3. C. O(logn), O(n)
  4. D. O(n), O(logn)
Report Error

What will be the height of a balanced full binary tree with 8 leaves?

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

Given that 2 elements are present in the tree, write a function to find the LCA(Least Common Ancestor) of the 2 elements.

  1. A. public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.right(); else if (root.data() < n1 && root.data() < n2) root = root.left(); else break; } System.out.println(root.data()); }
  2. B. public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() < n2) root = root.left(); else if (root.data() n2) root = root.right(); else break; } System.out.println(root.data()); }
  3. C. public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.left(); else if (root.data() < n1 && root.data() < n2) root = root.right(); else break; } System.out.println(root.data()); }
  4. D. public void lca(Tree root,int n1, int n2) { while (root != NULL) { if (root.data() > n1 && root.data() > n2) root = root.left.left(); else if (root.data() < n1 && root.data() < n2) root = root.right.right(); else break; } System.out.println(root.data()); }
Report Error

To restore the AVL property after inserting a element, we start at the insertion point and move towards root of that tree. is this statement true?

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

In general, the node content in a threaded binary tree is . . . . . . . .

  1. A. leftchild_pointer, left_tag, data, right_tag, rightchild_pointer
  2. B. leftchild_pointer, left_tag
  3. C. leftchild_pointer, left_tag, right_tag, rightchild_pointer
  4. D. leftchild_pointer, left_tag, data
Report Error

What are the operations that could be performed in O(logn) time complexity by red-black tree?

  1. A. insertion, deletion, finding predecessor, successor
  2. B. only insertion
  3. C. only finding predecessor, successor
  4. D. for sorting
Report Error