GATE CSE Trees – Data Structures Practice Test

GATE CSE Trees – Data Structures Practice Test | Set 1

Questions 31-35 of 100

0% completed (0/100 answered)

Question 31

MCQ · Single Correct 1 mark

What is the time complexity of deleting a node from a BST in terms of its height h?

A O(h) B O(1) C $O(n^2)$ D O(log n)

MCQ · Single Correct 1 mark

Which BST deletion case requires no subtree replacement?

A Deleting a node with one child B Deleting a leaf C Deleting the root D Deleting an internal node with two children

MCQ · Single Correct 1 mark

What is the inorder predecessor of a node with a nonempty left subtree?

A Root of tree B The maximum key in its left subtree C Maximum key in right subtree D Minimum key in right subtree

MCQ · Single Correct 1 mark

What is the inorder successor of a node with a nonempty right subtree?

A Root of tree B Maximum key in left subtree C The minimum key in its right subtree D Minimum key in left subtree

MCQ · Single Correct 1 mark

Which traversal is commonly used to serialize a binary tree while preserving null-child markers?

A Postorder B Level order C Preorder D Inorder