Commit 5dab472

committed

add Trie_representation

1 parent 5caeb2d commit 5dab472Copy full SHA for 5dab472

File tree

-0

lines changed

src/main/java/ir/sk/adt/datastructure/tree/trietree
- Trie.java
- Trie_representation.png

-0

lines changed

Lines changed: 5 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -6,6 +6,11 @@`
`6`	`6`	`import ir.sk.helper.pattern.HashingIndexPattern;`
`7`	`7`
`8`	`8`	`/**`
	`9`	`+ * Trie also called digital tree or prefix tree,[1] is a type of k-ary search tree, a tree data structure used for locating specific keys from within a set.`
	`10`	`+ * Unlike a binary search tree, nodes in the trie do not store their associated key.`
	`11`	`+ * Instead, a node's position in the trie defines the key with which it is associated.`
	`12`	`+ * usage: Replacement for hash table`
	`13`	`+ *`
`9`	`14`	`* Created by sad.kayvanfar on 5/18/2021.`
`10`	`15`	`*/`
`11`	`16`	`public class Trie {`

76.8 KB

Comments

(0)