27Mar

What is the time complexity of finding the kth smallest element in a binary search tree?

• O(n)

• O(log n)

• O(k)

• O(k log n)

Which of the following is NOT a property of a heap?

• It is a complete binary tree

• The root node is always the largest (in a max heap) or smallest (in a min heap) element

• It is always balanced

• Each node's value is greater (in a max heap) or smaller (in a min heap) than its children's values

What is the maximum number of nodes in an AVL tree of height 6?

• 63

• 127

• 255

• 511

What is the time complexity of finding the kth largest element in a max-heap?

• O(1)

• O(k log n)

• O(n)

• O(log n)

Which of the following is an example of a problem that can be solved using recursion with dynamic programming?

• Finding the longest common subsequence of two strings

• Generating all permutations of a set of elements

• Solving the traveling salesman problem

• Calculating the determinant of a matrix

What is the time complexity of inserting a node into a red-black tree?

• O(1)

• O(n)

• O(log n)

• O(log^2 n)

What is the worst-case time complexity of the backtracking algorithm for solving the n-queens problem?

• O(1)

• O(n)

• O(n!)

• O(2^n)

Which of the following is NOT an advantage of using a heap over other data structures?

• It has a small memory footprint

• It supports efficient insertion and deletion of elements

• It is easy to implement and maintain

• It provides efficient access to the smallest (in a min-heap) or largest (in a max-heap) element

What is the minimum number of nodes in an AVL tree of height 4?

• 7

• 8

• 15

• 16

What is the worst-case time complexity of backtracking algorithms?

• O(1)

• O(n)

• O(2^n)

• O(n^2)