@@ -104,13 +104,11 @@ describe('SBTree', function () {
104
104
sTree . push ( i ) ;
105
105
}
106
106
checkNil ( ) ;
107
- var maxHeight = 0 ;
108
107
for ( var i = 0 ; i < 2000000 ; ++ i ) {
109
108
var node = sTree . get ( i ) ;
110
- maxHeight = Math . max ( maxHeight , node . height ) ;
111
109
expect ( node . value ) . toBe ( i ) ;
112
110
}
113
- expect ( maxHeight ) . toBe ( 21 ) ;
111
+ expect ( sTree . _root . height ) . toBe ( 21 ) ;
114
112
for ( var i = 0 ; i < 2000000 ; ++ i ) {
115
113
expect ( sTree . get ( 0 ) . value ) . toBe ( i ) ;
116
114
var node = sTree . remove ( 0 ) ; // Always remove the first element;
@@ -135,24 +133,21 @@ describe('SBTree', function () {
135
133
expectedArray . splice ( newPos , 0 , i ) ;
136
134
}
137
135
expect ( sTree . size ) . toBe ( expectedArray . length ) ;
138
- maxHeight = 0 ;
139
136
for ( var i = 0 ; i < sTree . size ; ++ i ) {
140
137
var node = sTree . get ( i ) ;
141
- maxHeight = Math . max ( maxHeight , node . height ) ;
142
138
expect ( node . value ) . toBe ( expectedArray [ i ] ) ;
143
139
}
144
- console . log ( maxHeight ) ;
140
+ console . log ( sTree . _root . height ) ;
145
141
for ( var i = 0 ; i < 90000 ; ++ i ) {
146
142
var removedPos = getRandomInt ( 0 , sTree . size ) ;
147
143
sTree . remove ( removedPos ) ;
148
144
expectedArray . splice ( removedPos , 1 ) ;
149
145
}
150
146
for ( var i = 0 ; i < sTree . size ; ++ i ) {
151
147
var node = sTree . get ( i ) ;
152
- maxHeight = Math . max ( maxHeight , node . height ) ;
153
148
expect ( node . value ) . toBe ( expectedArray [ i ] ) ;
154
149
}
155
- console . log ( maxHeight ) ;
150
+ console . log ( sTree . _root . height ) ;
156
151
checkNil ( ) ;
157
152
} ) ;
158
153
} ) ;