algorithm/JavaScript
1
0
Fork 0
mirror of https://github.com/TheAlgorithms/JavaScript.git synced 2025-07-04 15:39:42 +08:00
Code Issues Packages Projects Releases Wiki Activity

feat: AVLTree 100% test coverage (#1098)

Browse Source
This commit is contained in:
k ho k ho?
2022-09-13 02:15:20 -07:00
committed by GitHub
parent 6ad2467545
commit e7ee09a07d
1 changed files with 34 additions and 5 deletions
Download Patch File Download Diff File Expand all files Collapse all files

39
Data-Structures/Tree/test/AVLTree.test.js
View File

@ -3,12 +3,14 @@ import { AVLTree } from '../AVLTree'
describe('AVLTree Implementation: ', () => { describe('AVLTree Implementation: ', () => {
const avlTree = new AVLTree() const avlTree = new AVLTree()
const dataList = [] const dataList = []
const demoData = [1, 4, 6, 22, 7, 99, 4, 66, 77, 98] const demoData = [1, 4, 6, 22, 7, 99, 4, 66, 77, 98, 87, 54, 32, 15]
const avlStringTree = new AVLTree() const avlStringTree = new AVLTree()
const collator = new Intl.Collator() const collator = new Intl.Collator()
const stringData = ['S', 'W', 'z', 'B', 'a'] const stringData = ['S', 'W', 'z', 'B', 'a']
const emptyTree = new AVLTree(collator.compare)
beforeAll(() => { beforeAll(() => {
demoData.forEach(item => { demoData.forEach(item => {
if (avlTree.add(item)) { if (avlTree.add(item)) {
@ -20,6 +22,11 @@ describe('AVLTree Implementation: ', () => {
stringData.forEach(item => avlStringTree.add(item)) stringData.forEach(item => avlStringTree.add(item))
}) })
it('delete and search from empty tree', () => {
expect(emptyTree.remove(0)).toBeFalsy()
expect(emptyTree.find(0)).toBeFalsy()
})
it('checks if element is inserted properly', () => { it('checks if element is inserted properly', () => {
expect(dataList.length).toEqual(avlTree.size) expect(dataList.length).toEqual(avlTree.size)
expect(stringData.length).toEqual(avlStringTree.size) expect(stringData.length).toEqual(avlStringTree.size)
@ -34,9 +41,31 @@ describe('AVLTree Implementation: ', () => {
}) })
}) })
it('deletes the inserted element', () => { it('delete element with two valid children', () => {
const deleteElement = dataList[3] expect(avlTree.remove(77)).toBeTruthy()
expect(avlTree.remove(deleteElement)).toBeTruthy() })
expect(avlStringTree.remove(stringData[3])).toBeTruthy()
it('delete element missing L-child', () => {
expect(avlTree.remove(98)).toBeTruthy()
})
it('delete elements forcing single R-rotation', () => {
expect(avlTree.remove(99)).toBeTruthy()
expect(avlTree.remove(87)).toBeTruthy()
})
it('delete elements forcing R-rotation and L-rotation', () => {
expect(avlTree.remove(1)).toBeTruthy()
expect(avlTree.remove(4)).toBeTruthy()
})
it('delete elements forcing single L-rotation', () => {
expect(avlTree.remove(7)).toBeTruthy()
expect(avlTree.remove(15)).toBeTruthy()
expect(avlTree.remove(6)).toBeTruthy()
})
it('delete element forcing single L-rotation and R-rotation', () => {
expect(avlTree.remove(66)).toBeTruthy()
}) })
}) })