Advantages and disadvantages of B-star trees over Binary trees?
One of the basic question algorithm and data structure problem which is asked in the algorithm questions. B-star trees have better data structure and are faster in search than Binary trees, but it is more complex than simple binary tree and very hard to maination the B-star treee data structure.
-
-
Job Interview Questions
- Certification Interview Questions
- Company Interview Questions
- Computer Language Interview Questions
- Computer Science Interview Questions
- Database Interview Questions
- Graphics and UI Interview Questions
- HR Interview Questions
- Java Technical Interview Questions
- Linux Interview Questions
- Manager Interview Questions
- Medical Interview Questions
- Microsoft Technology Interview Questions
- Operating System Interview Questions
- Sample Interview Questions
- Scripting Interview Questions
- Technical Interview Questions
- Testing and QA Interview Questions
-
Categories
Tags
ADO.NET Questions Algorithm Questions ASP.NET Questions auto_ptr Binary tree questions C++ Constructor Interview Questions C++ Questions CISCO Exams Questions Common Interview Questions Core Java Interview Questions Csharp Questions datastructure questions Delphi 6 find command gdb interview questions grep interview questions IBM certification exams questions Infosys Puzzles Java Struts Linked List Problem Linux Command Questions List Manager Interview Questions Markov Algorithm memory leakage mysql Interview Questions Normalization Oracle Application Developer Certification Exam Interview Questions Oracle Questions Perl Questions PHP Questions Pointers Interview Questions PostgreSQL Database Questions pthread interview questions Smart Pointer Solaris Interview Questions SQL SERVER Interview Questions STL STL Map Symbian OS Tricky Interview Questions Unix Interview Questions unix shell Vector Windows OS Questions