@@ -276,8 +276,8 @@ def _test_BinarySearchTree(backend):
276
276
277
277
assert bl .lowest_common_ancestor (18 , 10 , 2 ) == 15
278
278
assert bl .lowest_common_ancestor (55 , 100 , 2 ) == 90
279
- # assert bl.lowest_common_ancestor(16, 80, 2) == 50
280
- # assert bl.lowest_common_ancestor(30, 55, 2) == 50
279
+ assert bl .lowest_common_ancestor (16 , 80 , 2 ) == 50
280
+ assert bl .lowest_common_ancestor (30 , 55 , 2 ) == 50
281
281
282
282
assert raises (ValueError , lambda : bl .lowest_common_ancestor (60 , 200 , 2 ))
283
283
assert raises (ValueError , lambda : bl .lowest_common_ancestor (200 , 60 , 2 ))
@@ -286,12 +286,12 @@ def _test_BinarySearchTree(backend):
286
286
assert bl .lowest_common_ancestor (80 , 55 , 1 ) == 70
287
287
assert bl .lowest_common_ancestor (60 , 70 , 1 ) == 70
288
288
assert bl .lowest_common_ancestor (18 , 18 , 1 ) == 18
289
- # assert bl.lowest_common_ancestor(40, 90, 1) == 50
289
+ assert bl .lowest_common_ancestor (40 , 90 , 1 ) == 50
290
290
291
291
assert bl .lowest_common_ancestor (18 , 10 , 1 ) == 15
292
292
assert bl .lowest_common_ancestor (55 , 100 , 1 ) == 90
293
- # assert bl.lowest_common_ancestor(16, 80, 1) == 50
294
- # assert bl.lowest_common_ancestor(30, 55, 1) == 50
293
+ assert bl .lowest_common_ancestor (16 , 80 , 1 ) == 50
294
+ assert bl .lowest_common_ancestor (30 , 55 , 1 ) == 50
295
295
296
296
assert raises (ValueError , lambda : bl .lowest_common_ancestor (60 , 200 , 1 ))
297
297
assert raises (ValueError , lambda : bl .lowest_common_ancestor (200 , 60 , 1 ))
0 commit comments