×
Home Discussions Write at Opengenus IQ
×
  • Join our Internship ๐ŸŽ“
  • #7daysOfCode
  • C Interview questions
  • Linux ๐Ÿ’ฝ
  • ๐Ÿ”Š Data Structures
  • Graph Algorithms
  • Dynamic Programming ๐Ÿ’‘
  • Greedy Algo ๐Ÿ“”
  • Algo Book ๐Ÿง 
  • String Algo ๐Ÿงฌ
  • Home

trie

A collection of 6 posts

Data Structures

Radix Tree [Compact version of Trie]

radix tree is a compact version of a trie. It takes advantage of this and will store multiple characters / string of text in an edge instead to reduce the number of extra edges and nodes needed.

Ethan Z. Booker
Algorithms

All Valid Word Breaks of a Sentence ใ€O(2^N) time complexityใ€‘

We are given with a valid sentence without any spaces and we are given with a dictionary of words. We need to print all the possible ways to break the sentence so that all the breaked words belongs to the dictionary.

Sadanand Vishwas Sadanand Vishwas
Data Structures

Y fast trie

Y-fast trie is a data structure used to store integers from a bounded domain. It has two data structures X fast trie and balanced binary search tree with the change being we operate on representative values r in X-fast tries, and the leaf nodes point to balanced binary search trees instead of values

Yash Aggarwal Yash Aggarwal
Data Structures

X-fast trie

X-fast trie is a data structure used to store integers from a bounded domain. It is a bitwise trie, i.e. a binary tree where each subtree stores values having binary representations with common prefix. It is a trie of hash tables and supports successor and predecessor operations in log log U time

Yash Aggarwal Yash Aggarwal
Data Structures

Trie data structure

A trie (digital tree, radix tree, prefix tree) is a kind of an ordered search tree data structure that is used to store a dynamic set or associative array where the keys are usually strings. Worst case search time complexity is ฮ˜(key_length) and trie is widely used in real life applications

Vipul Gupta Vipul Gupta
Data Structures

Ternary Search Trees

Ternary Search Tree is a special type of trie data structure and is widely used as an low memory alternative to trie in a vast range of applications like spell check and near neighbor searching. The average case time complexity is O(log N) for look-up, insertion and deletion operation.

Aman Agarwal Aman Agarwal
×

Visit our discussion forum to ask any question and join our community

View Forum
OpenGenus IQ © 2021 All rights reserved โ„ข [email: team@opengenus.org]
Top Posts LinkedIn Twitter