UNPKG

javascript-algorithms-and-data-structures

Version:

Algorithms and data-structures implemented on JavaScript

52 lines (37 loc) 1.32 kB
import TrieNode from '../TrieNode'; describe('TrieNode', () => { it('should create trie node', () => { const trieNode = new TrieNode('c', true); expect(trieNode.character).toBe('c'); expect(trieNode.isCompleteWord).toBeTruthy(); expect(trieNode.toString()).toBe('c*'); }); it('should add child nodes', () => { const trieNode = new TrieNode('c'); trieNode.addChild('a', true); trieNode.addChild('o'); expect(trieNode.toString()).toBe('c:a,o'); }); it('should get child nodes', () => { const trieNode = new TrieNode('c'); trieNode.addChild('a'); trieNode.addChild('o'); expect(trieNode.getChild('a').toString()).toBe('a'); expect(trieNode.getChild('o').toString()).toBe('o'); expect(trieNode.getChild('b')).toBeUndefined(); }); it('should check if node has specific child', () => { const trieNode = new TrieNode('c'); trieNode.addChild('a'); trieNode.addChild('o'); expect(trieNode.hasChild('a')).toBeTruthy(); expect(trieNode.hasChild('o')).toBeTruthy(); expect(trieNode.hasChild('b')).toBeFalsy(); }); it('should suggest next children', () => { const trieNode = new TrieNode('c'); trieNode.addChild('a'); trieNode.addChild('o'); expect(trieNode.suggestChildren()).toEqual(['a', 'o']); }); });