Ans
A1 B-star trees have better data structure and are faster in search than Binary trees, but it’s harder to write codes for B-start trees.
Subscribe to:
Post Comments (Atom)
Cracking the Coding Interview: Fourth Edition (308 page e-book / PDF)
Delivered instantly as a PDF via email. For Software Engineers & SDETs
- 150 programming interview questions and answers
- 5 proven approaches to crack algorithm questions
- 10 mistakes candidates make, and how to avoid them.
- How to prepare for technical and behavioral questions without wasting your time!
Just $29.99 to Crack the Interview!
No comments:
Post a Comment