1
exercism fetch coffeescript binary-search-tree

binary_search_tree_test.spec.coffee

1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
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]