What are the lesser known but useful data structures?

by

Tries, also known as prefix-trees or crit-bit trees, have existed for over 40 years but are still relatively unknown. A very cool use of tries is described in “TRASH – A dynamic LC-trie and hash data structure“, which combines a trie with a hash function.

More Related Contents:

  1. Why should hash functions use a prime number modulus?
  2. What is Type-safe?
  3. Under what circumstances are linked lists useful?
  4. What is a Lambda?
  5. Hash Code and Checksum – what’s the difference?
  6. Converting EBNF to BNF
  7. What are bitwise shift (bit-shift) operators and how do they work?
  8. GOTO still considered harmful? [closed]
  9. How should I do floating point comparison?
  10. What is a lambda (function)?
  11. What is an idempotent operation?
  12. Ukkonen’s suffix tree algorithm in plain English
  13. How Does Modulus Divison Work
  14. What is the difference between concurrent programming and parallel programming?
  15. What is an existential type?
  16. Get the application’s path
  17. Why don’t languages raise errors on integer overflow by default?
  18. Is there a difference between foreach and map?
  19. How do I display the binary representation of a float or double?
  20. design a stack such that getMinimum( ) should be O(1)
  21. Are circular class dependencies bad from a coding style point of view? [closed]
  22. Difference between parameter and argument [duplicate]
  23. What is the difference between Type and Class?
  24. Fluent Interfaces – Method Chaining
  25. ICalendar and event updates not working in Outlook
  26. When is a do-while appropriate?
  27. How can I find the smallest difference between two angles around a point?
  28. Purity vs Referential transparency
  29. When a method has too many parameters? [closed]
  30. Why are leading zeroes used to represent octal numbers?

Leave a Comment