Commit ddec5a6

committed

update: entry in readme

1 parent a3cafc8 commit ddec5a6Copy full SHA for ddec5a6

File tree

2 files changed

+12

-12

lines changed

README.md
src/_DataStructures_/Trees/Trie
- index.js

2 files changed

+12

-12

lines changed

`‎README.md‎`

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -31,17 +31,16 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct`
`31`	`31`	`- [Implement 2 Stacks using Single Array](src/_DataStructures_/Stack/2-stacks-using1-array)`
`32`	`32`	`- [Sort a Stack](src/_DataStructures_/Stack/sort-a-stack)`
`33`	`33`
`34`		`-`
`35`		`-- [Queue](src/_DataStructures_/Queue)`
	`34`	`+* [Queue](src/_DataStructures_/Queue)`
`36`	`35`
`37`	`36`	`- [Weave](src/_DataStructures_/Queue/weave)`
`38`	`37`	`- [Reverse First K Elements of a Queue](src/_DataStructures_/Queue/reverse-first-k)`
`39`	`38`	`- [Generate all Binary Numbers from 1 to N](src/_DataStructures_/Queue/generate-binary-number)`
`40`	`39`	`- [Queue using Stack](src/_DataStructures_/Queue/queue-using-stack)`
`41`	`40`
`42`		`-- [Doubly Linked List](src/_DataStructures_/DoublyLinkedList)`
	`41`	`+* [Doubly Linked List](src/_DataStructures_/DoublyLinkedList)`
`43`	`42`
`44`		`-- [Trees](src/_DataStructures_/Trees)`
	`43`	`+* [Trees](src/_DataStructures_/Trees)`
`45`	`44`	`- [Binary Tree (creation using level order)](src/_DataStructures_/Trees/BinaryTree)`
`46`	`45`	`- [Binary Search Tree](src/_DataStructures_/Trees/BinarySearchTree)`
`47`	`46`	`- [Find k<sup>th</sup> maximum in a BinarySearchTree](src/_DataStructures_/Trees/BinarySearchTree/find-kth-max)`
`@@ -50,6 +49,7 @@ Collection of interview questions with Unit Tests. Problems includes Data Struct`
`50`	`49`	`- [Find Height of BST](src/_DataStructures_/Trees/BinarySearchTree/height-of-bst)`
`51`	`50`	`- [Find k Nodes from Root of BST](src/_DataStructures_/Trees/BinarySearchTree/find-k-nodes-from-root)`
`52`	`51`	`- [Suffix Tree](src/_DataStructures_/SuffixTree)`
	`52`	`+ - [Trie](src/_DataStructures_/Trees/Trie)`
`53`	`53`
`54`	`54`	`### Logical Problems`
`55`	`55`

`‎src/_DataStructures_/Trees/Trie/index.js‎`

Lines changed: 8 additions & 8 deletions

Original file line number	Diff line number	Diff line change
`@@ -58,16 +58,16 @@ class Trie {`
`58`	`58`	`}`
`59`	`59`	`}`
`60`	`60`
`61`		`-const words = ['bed', 'ball', 'apple', 'java', 'javascript'];`
`62`		`-const trie = new Trie();`
	`61`	`+// const words = ['bed', 'ball', 'apple', 'java', 'javascript'];`
	`62`	`+// const trie = new Trie();`
`63`	`63`
`64`		`-words.forEach(word => trie.insert(word));`
	`64`	`+// words.forEach(word => trie.insert(word));`
`65`	`65`
`66`		`-console.log(trie.root);`
	`66`	`+// console.log(trie.root);`
`67`	`67`
`68`		`-console.log(trie.search(words[3]));`
`69`		`-console.log(trie.search('word'));`
`70`		`-console.log(trie.search(words[4]));`
`71`		`-console.log(trie.search('random'));`
	`68`	`+// console.log(trie.search(words[3]));`
	`69`	`+// console.log(trie.search('word'));`
	`70`	`+// console.log(trie.search(words[4]));`
	`71`	`+// console.log(trie.search('random'));`
`72`	`72`
`73`	`73`	`module.exports = Trie;`

0 commit comments

Comments

(0)

Navigation Menu

Search code, repositories, users, issues, pull requests...

Provide feedback

Saved searches

Use saved searches to filter your results more quickly

Uh oh!

Commit ddec5a6

File tree

2 files changed

2 files changed

`‎README.md‎`

`‎src/_DataStructures_/Trees/Trie/index.js‎`

0 commit comments