Current Slide

Small screen detected. You are viewing the mobile version of SlideWiki. If you wish to edit slides you will need to use a larger device.


  • Simplest: binary tree

  • More usual: B-trees

  • Trees require a standard ordering of characters and hence strings … but we typically have one

  • Pros:

    • Solves the prefix problem (terms starting with hyp)

  • Cons:

    • Slower: O(log M) [and this requires balanced tree]

    • Rebalancing binary trees is expensive

      • But B-trees mitigate the rebalancing problem

Speaker notes:

Content Tools


There are currently no sources for this slide.