File tree Expand file tree Collapse file tree 1 file changed +11
-12
lines changed Expand file tree Collapse file tree 1 file changed +11
-12
lines changed Original file line number Diff line number Diff line change @@ -8,8 +8,8 @@ import assert from 'assert'
8
8
9
9
class Node {
10
10
constructor ( key , val , next ) {
11
- this . key = key
12
- this . val = val
11
+ this . key = key
12
+ this . val = val
13
13
this . next = next
14
14
}
15
15
}
@@ -33,9 +33,7 @@ class sequentialSearchST {
33
33
34
34
get ( key ) {
35
35
36
- console . log ( this )
37
36
for ( let node of this ) {
38
-
39
37
if ( key === node . key ) {
40
38
return node . val
41
39
}
@@ -51,11 +49,11 @@ class sequentialSearchST {
51
49
return ( {
52
50
next ( ) {
53
51
if ( current ) {
54
- let { key , val } = current
55
- current = current . next
52
+ let node = current
53
+ current = current . next
56
54
return {
57
55
done : false ,
58
- val : { key , val }
56
+ value : node
59
57
}
60
58
} else {
61
59
return {
@@ -73,8 +71,9 @@ let st = new sequentialSearchST()
73
71
assert . equal ( st . get ( 'a' ) , null )
74
72
st . put ( 'a' , '1' )
75
73
assert . equal ( st . get ( 'a' ) , '1' )
76
- //st.put('b', '2')
77
- //assert.equal(st.get('b'), '2')
78
- //st.put('b', '3')
79
- //assert.equal(st.get('a'), '1')
80
- //assert.equal(st.get('b'), '3')
74
+ st . put ( 'b' , '2' )
75
+ assert . equal ( st . get ( 'b' ) , '2' )
76
+ st . put ( 'b' , '3' )
77
+ assert . equal ( st . get ( 'a' ) , '1' )
78
+ console . log ( st . get ( 'b' ) )
79
+ assert . equal ( st . get ( 'b' ) , '3' )
You can’t perform that action at this time.
0 commit comments