Test Difficulty Level: Medium
Syllabus of Test
Data Structure: Questions based on the Trees.
Sample Question from this online test:
Question: The smallest number of key that will force a B-tree of order 3 to have a height 3 is
Option A: 12
Option B: 10
Option C: 7
Option D: None of these
To answer, click the "Start This Test" button below.
Related Online Tests:
archana kandachar on 2010-11-14 11:38:05 wrote,
Q4. when binary tree is traversed in inorder numbers will be printed in ascending order.
uma vanth on 2011-05-02 04:26:40 wrote,
most of the questions are from GATE book. Useful material
Atul Badjatya on 2011-08-02 09:09:47 wrote,
when binary tree is traversed in inorder numbers will be printed in ascending order.
ashish sood on 2011-08-10 19:41:25 wrote,
these are valid for a BINARY SEARCH TREE nd not for a BINARY TREE
vishal srivastava on 2012-05-28 17:32:18 wrote,
4,5,16 are wrongly answered