Trie Insert and Search
Автор: IDeserve
Загружено: 2016-03-24
Просмотров: 13564
A trie is a data structure used for efficient retrieval of data associated with keys. If key is of length n, then using trie worst case time complexity for searching the record associated with this key is O(n). Insertion of (key, record) pair also takes O(n) time in worst case.
Trie's retrieval/insertion time in worst case is better than hashTable and binary search tree both of which take worst case time of O(n) for retrieval/insertion. The trie structure though in theory has same worst case space complexity as hashTable or a binary tree, memory needed to store pointers causes it to be less space efficient during implementations.
Web-article: http://www.ideserve.co.in/learn/trie-...
Website: http://www.ideserve.co.in
Facebook: / ideserve.co.in
Доступные форматы для скачивания:
Скачать видео mp4
-
Информация по загрузке:
