List of top Computer Science Questions on Binary Search Tree

Which of the following statements are correct?
• [A.] An adjacency matrix uses \(O(n^2)\) of the adjacency list is \(O(n + m)\)
• [B.] The adjacency matrix requires \(O(n^2)\) memory
• [C.] In an undirected graph, the sum of lengths of adjacency lists is \(2m\)
• [D.] The memory requirement of adjacency list is dependent on the number of edges in the graph
Choose the correct answer from the options given below:

Which of the following statements are correct?
• [A.] An adjacency matrix uses \(O(n^2)\) of the adjacency list is \(O(n + m)\)
• [B.] The adjacency matrix requires \(O(n^2)\) memory
• [C.] In an undirected graph, the sum of lengths of adjacency lists is \(2m\)
• [D.] The memory requirement of adjacency list is dependent on the number of edges in the graph
Choose the correct answer from the options given below:

The set T represents various traversals over a binary tree. The set S represents the order of visiting nodes during a traversal. Which one of the following is the correct match from T to S?

In case of Binary Search Tree, which of the following procedure's running time is distinct among all?

In a binary search tree, the worst case time complexity of inserting and deleting a key is: