Mining Engineering > GATE 2020 > Logical Reasoning
P, Q, R, S, T, U, V, and W are seated around a circular table.
I. S is seated opposite to W.
II. U is seated at the second place to the right of R.
III. T is seated at the third place to the left of R.
IV. V is a neighbour of S.
Which of the following must be true?
A
P is a neighbour of R.
B
Q is a neighbour of R.
C
P is not seated opposite to Q.
D
R is the left neighbour of S.

Explanation

Correct : c

Similar Questions

What is the worst-case time complexity of insertion in an AVL tree?
Question #23 Medium
Which operations on a binary search tree have O(h) complexity?
Question #31 Easy
Compare search complexities of sorted array vs balanced BST.
Question #47 Hard

Related Topics

Data Structures Binary Search Tree Time Complexity Algorithm Analysis Tree Algorithms Computer Science