Sha256: 43033532b6805e70e94c0b25b5641f1016957092ced085578fd98ca6fa964987
Contents?: true
Size: 1.61 KB
Versions: 396
Compression:
Stored size: 1.61 KB
Contents
Bst = require './bst'
recordAllData = (bst) ->
out = []
bst.each((data) -> out.push(data))
out
describe 'BinarySearchTree', ->
it 'data is retained', ->
expect(4).toEqual new Bst(4).data
xit 'inserting less', ->
four = new Bst(4)
four.insert(2)
expect(four.data).toEqual 4
expect(four.left.data).toEqual 2
xit 'inserting same', ->
four = new Bst(4)
four.insert(4)
expect(four.data).toEqual 4
expect(four.left.data).toEqual 4
xit 'inserting right', ->
four = new Bst(4)
four.insert(5)
expect(four.data).toEqual 4
expect(four.right.data).toEqual
xit 'complex tree', ->
four = new Bst(4)
four.insert(2)
four.insert(6)
four.insert(1)
four.insert(3)
four.insert(7)
four.insert(5)
expect(four.data).toEqual 4
expect(four.left.data).toEqual 2
expect(four.left.left.data).toEqual 1
expect(four.left.right.data).toEqual 3
expect(four.right.data).toEqual 6
expect(four.right.left.data).toEqual 5
expect(four.right.right.data).toEqual 7
xit 'iterating one element', ->
expect(recordAllData(new Bst(4))).toEqual [4]
xit 'iterating over smaller element', ->
four = new Bst(4)
four.insert(2)
expect(recordAllData(four)).toEqual [2, 4]
xit 'iterating over larger element', ->
four = new Bst(4)
four.insert(5)
expect(recordAllData(four)).toEqual [4, 5]
xit 'iterating over complex tree', ->
four = new Bst(4)
four.insert(2)
four.insert(1)
four.insert(3)
four.insert(6)
four.insert(7)
four.insert(5)
expect(recordAllData(four)).toEqual [1, 2, 3, 4, 5, 6, 7]
Version data entries
396 entries across 396 versions & 1 rubygems