Trees quizz

In a binary search tree, the left subtree of a node contains nodes with values:

• A) Greater than the node's value
  

• B) Less than the node's value
  

• C) Equal to the node's value
  

• D) Random values

. Which traversal technique is used to find the minimum element in a binary search tree (BST)?

• A) Pre-order traversal
  

• B) In-order traversal
  

• C) Post-order traversal
  

• D) Leftmost traversal

What is the time complexity of searching an element in a balanced binary search tree (BST)?

• A) O(1)
  

• B) O(log n)
  

• C) O(n)
  

• D) O(n log n)

Which of the following is the correct definition of a Red-Black Tree?

• A) A self-balancing binary search tree
  

• B) A binary tree where each node is colored either red or black
  

• C) Both A and B
  

• D) None of the above

What is the time complexity of inserting an element into an AVL tree?

• A) O(1)
  

• B) O(log n)
  

• C) O(n)
  

• D) O(n log n)

Which of the following statements is true about a heap data structure?

• A) It is a binary tree.
  

• B) In a max-heap, the parent node is always smaller than its children.
  

• C) It is used to implement priority queues.
  

• D) It is always a balanced tree.

Which traversal method is best used to print the nodes of a binary tree in ascending order?

• A) Pre-order traversal
  

• B) In-order traversal
  

• C) Post-order traversal
  

• D) Level-order traversal

What is the time complexity for deleting a node in a binary search tree (BST) with n nodes?

• A) O(1)
  

• B) O(log n)
  

• C) O(n)
  

• D) O(n log n)

Which of the following properties is true for a binary search tree (BST)?

• C) In-order traversal results in sorted order of elements.
  

• B) The right child is always less than the parent node.
  

• A) The left child is always greater than the parent node.
  

• D) Each node can have more than two children.

What is the primary advantage of using a self-balancing binary search tree?

• C) It is easier to implement than a regular BST.
  

• A) It requires less memory than a regular BST.
  

• B) It guarantees O(log n) time complexity for search, insert, and delete operations.
  

• D) It allows duplicate values in the tree.