Question
What is the worst-case time complexity for searching an
element in a general (unbalanced) binary tree?Solution
In the worst case, a general binary tree can degenerate into a skewed tree (like a linked list), where searching for an element might require traversing all 'n' nodes, leading to O(n) time complexity.
In a certain language, the word CLOCK is written as 4 – 13 – 17 – 4 – 12. How will you write PHONE in the same language?
Raman and his sister Shikha study in the same class. Raman's rank in an examination is 11th from the bottom and Shikha's rank in the same examination is...
Which of the following is different from others?
If the letters ‘Q B Z H X K H Q D U M B’ are placed in the order opposite to the one in which these normally appear in English Alphabet (i.e., in re...
Select the option that is related to the fifth term in the same way as the second term is related to the first term and the fourth term is related to th...
A, B, C, D, E, F and G are sitting around a circular table, facing the centre. Only one person sits between F and C when counted from the left of C. B s...
Select the option that will fill in the blank and complete the given series correctly.
100, 105, 111, 118, 126, 135, ______
Select the correct mirror image of the given figure when the mirror is placed at MN as shown below.
Select the figure from among the given options that can replace the question mark (?) in the following series.
From the given question, find which figure comes after the four figures which are in series?
