BD Merit - Freelancing, BCS, Bank, Primary, Admission, NTRCA

1 . which data structure is used for indexing

A. Binary Tree
B. B-Tree
C. stack
D. Link list

View Answer

Discuss in Forum

Workspace

Report

Answer: Option C

Explanation:

The data structure most commonly used for database indexes are B - trees, a specific kind of self - balancing tree. A picture's worth a thousand words, so here's an example. The main benefit of a B - tree is that it allows logarithmic selections, insertions, and deletions in the worst case scenario.

Sonali- Rupali- Bangladesh Krishi- Rajshahi krishi unnayn-Investment Corporation of Bangladesh | 30.11.2018

কোর্স ক্যাটাগরি

প্রয়োজনীয় লিঙ্ক