Computer Sciences > Gate 2024 Set-2 > Thread
Consider the following expression: π‘₯[𝑖]=(𝑝+π‘Ÿ)βˆ—βˆ’π‘ [𝑖]+𝑒/𝑀. The following sequence shows the list of triples representing the given expression, with entries missing for triples (1), (3), and (6).
Which one of the following options fills in the missing entries CORRECTLY?
A
(1) =[]⁑⁑𝑠⁑⁑𝑖   (3) * (0) (2)   (6) []=⁑⁑π‘₯⁑⁑𝑖
B
(1) []=⁑⁑𝑠⁑⁑𝑖   (3) –⁑(0)⁑(2)   (6) =[] ⁑π‘₯⁑⁑(5)
C
(1) =[] ⁑𝑠⁑𝑖   (3) * (0)⁑⁑(2)   (6) []= ⁑π‘₯⁑⁑(5)
D
(1) []= ⁑𝑠⁑⁑𝑖   (3) –⁑(0)⁑(2)   (6) =[] π‘₯⁑⁑𝑖

Explanation

Correct : a

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