Question
A complete binary tree has 127 nodes. What is its height
(assuming the root is at level 0)?Solution
For a complete binary tree, the number of nodes N = 2^(h+1) - 1, where h is the height. 127 = 2^(h+1) - 1 128 = 2^(h+1) 2^7 = 2^(h+1) 7 = h+1 h = 6
They were ________________ by nature with a strong work ethic and a firm belief in self-sufficiency.
Fill in the blank with the most appropriate word.
They ….for 10 hours a day in summer and a mere seven in winter.
- Given below is a sentence with one blank. Below the sentence are given four words among which one word might fill the blank. If none of the words fill the ...
Tagore was a great man with a high level of ________.
The chairman will ---------- over an audience of architects and developers.
I. The pace and the discipline with which the parties announced the coalition ___________ that they are serious about forming a stable government.
...The advocate, Sergei, _____ at the ragged, fawn-coloured overcoat _____ the suppliant, at his dull, drunken eyes, at the red spot ______ either cheek, ...
In the following sentences, two words are omitted. Choose the correct option that can fill the blanks both contextually and grammatically.
The ...
- Given below is a sentence with one blank. Below the sentence are given four words among which one word might fill the blank. If none of the words fill the ...
Choose the most appropriate word from the options that can fill the blanks.
Despite multiple intelligence briefings and early satellite data s...
