# Data Structure: Trees - Online Test

## 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.*

## Start this Test

## Related Online Tests:

## Comments

archana kandachar on Q4. when binary tree is traversed in inorder numbers will be printed in ascending order. | |

uma vanth on most of the questions are from GATE book. Useful material | |

Atul Badjatya on when binary tree is traversed in inorder numbers will be printed in ascending order. | |

ashish sood on these are valid for a BINARY SEARCH TREE nd not for a BINARY TREE | |

vishal srivastava on 4,5,16 are wrongly answered |