Consider a complete graph G with 4 vertices. The graph G has ____ spanning trees.

Where is Breadth-First Search (BFS) used?

What is the header file for the string class?

By using quick sort, which sorting algorithm begins sorting the given array?

What is the computational complexity of the Binary GCD (Greatest Common Divisor) algorithm where m and n are integers?

Which of the following operations on a singly linked list are dependent on the length of the linked list?

What is the time complexity of the following function?

int fun(int n)
{
  int count = 0;
  for (int i = 0; i < n; i++)
     for (int j = i; j > 0; j--)
         count = count + 1;
  return count;
} 

What type of tree traversal is represented by the following code?

public void f(Tree root)
{
      f (root.left());
System.out.println(root.data());
f(root.right());
}

Given a pointer to a node X in a singly linked list, where the head pointer is not available, can we delete the node X from the given linked list?

Which of the following statements about binary search trees and AVL trees is TRUE?