Data Structure: Trees - Online Test

Test Difficulty Level: Medium

Data Structure: Questions based on the Trees.

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.

	archana kandachar on 2010-11-14 05:38:05 wrote, Q4. when binary tree is traversed in inorder numbers will be printed in ascending order. Q5. Visiting the root first then left subtree, then right subtree is preorder traversal.Please check.
	uma vanth on 2011-05-01 23:26:40 wrote, most of the questions are from GATE book. Useful material
	Atul Badjatya on 2011-08-02 04:09:47 wrote, when binary tree is traversed in inorder numbers will be printed in ascending order. Q5. Visiting the root first then left subtree, then right subtree is preorder traversal.Please check
	ashish sood on 2011-08-10 14:41:25 wrote, these are valid for a BINARY SEARCH TREE nd not for a BINARY TREE