C++ : Syntax And Statements - Online Test

Test Difficulty Level: Easy

Syllabus of Test

Sample Question from this online test:

Question: The maximum number of nodes in a binary tree of depth k is -

Option A: 2^k-1

Option B: 2^k-2

Option C: 2^(k-1)

Option D: 2^k+2x+1

To answer, click the "Start This Test" button below.

Start this Test






Comments

Piyush Patel on 2009-07-31 17:03:40 wrote,

........