def test_remove(): t = SplayTree() t.remove(1) t.insert(1) t.insert(2) t.remove(2) t.remove(1)
def testLargeInserts(self): t = SplayTree() nums = 40000 gap = 307 i = gap while i != 0: t.insert(i) i = (i + gap) % nums
def test_find(): splay_tree = SplayTree() assert pytest.raises(ValueError, splay_tree.find, 1) splay_tree.insert(10, 10) splay_tree.insert(8, 8) splay_tree.insert(12, 12) assert splay_tree.find(8) == 8 assert splay_tree.find(20) is None
def test_insert(): splay_tree = SplayTree() splay_tree.insert(10) splay_tree.insert(8) splay_tree.insert(12) splay_tree.insert(13) splay_tree.insert(7) x = splay_tree.pre_order(splay_tree.root(), []) assert x == [7, 8, 10, 12, 13]
def testFind(self): """Test if items inserted into the splay tree can be found again.""" N = randint(20, 150) s = SplayTree() for i in xrange(N): self.s.insert(i, 1) for i in xrange(N): a = self.s.find(i) self.assertTrue(a) N -= a self.assertEqual(N, 0)
def test_isEmpty(): t = SplayTree() assert (t.isEmpty())
def test_find(): t = SplayTree() assert (t.find(1) == None) t.insert(1) assert (t.find(1) == 1) assert (t.find(10) == None)
def test_findMax(): t = SplayTree() assert (t.findMax() == None) t.insert(1) t.insert(-1) assert (t.findMax() == 1)
def test_findMin(): t = SplayTree() assert (t.findMin() == None) t.insert(1) t.insert(2) assert (t.findMin() == 1)
def test_insert(): t = SplayTree() t.insert(1) t.insert(1)
def setUp(self): self.s = SplayTree()
def testConstructor(self): """Test if SplayTree can be constructed without raising an exception.""" SplayTree() self.assertIsNotNone(self.s) self.assertIsInstance(self.s, SplayTree)
def setUp(self): self.keys = [0, 1, 2, 3, 4, 5, 6, 7, 8, 9] self.t = SplayTree() for key in self.keys: self.t.insert(key)
def testIsEmpty(self): self.assertFalse(self.t.isEmpty()) t = SplayTree() self.assertTrue(t.isEmpty())