Need full test coverage

I am creating a test class for the following code. splay_test.py which is the unit test code for splay tree. The following code creates the slay tree. I just needed help with writing unit tests for python to get %100 coverage. I am very bad at unit testing but have started off ok. just need someone to help me finish it off and maybe find any more bugs. My coverage test for some reasion isn't connecting the two files together.

        class Node:
            def __init__(self, key):
                self.key = key
                self.left = self.right = None

            def equals(self, node):
                return self.key == node.key


        class SplayTree:
            def __init__(self):
                self.root = None
                self.header = Node(None)  # For splay()

            def insert(self, key):
                if (self.root == None):
                    self.root = Node(key)
                    return #test

                self.splay(key)
                if self.root.key == key:
                    # If the key is already there in the tree, don't do anything.
                    return

                n = Node(key)
                if key < self.root.key:
                    n.left = self.root.left
                    n.right = self.root
                    self.root.left = None
                else:
                    n.right = self.root.right
                    n.left = self.root
                    self.root.right = None
                self.root = n

            def remove(self, key):
                self.splay(key)
                if key != self.root.key:
                    raise 'key not found in tree' # do

                # Now delete the root.
                if self.root.left == None:
                    self.root = self.root.right
                else:
                    x = self.root.right
                    self.root = self.root.left
                    self.splay(key)
                    self.root.right = x

            def findMin(self):
                if self.root == None:
                    return None
                x = self.root
                while x.left != None:
                    x = x.left
                self.splay(x.key)
                return x.key

            def findMax(self):
                if self.root == None:
                    return None
                x = self.root
                while (x.right != None):
                    x = x.right
                self.splay(x.key)
                return x.key

            def find(self, key): # test
                if self.root == None:
                    return None
                self.splay(key)
                if self.root.key != key:
                    return None
                return self.root.key

            def isEmpty(self):
                return self.root == None

            def splay(self, key): # test
                l = r = self.header
                t = self.root
                self.header.left = self.header.right = None
                while True:
                    if key < t.key:
                        if t.left == None:
                            break
                        if key < t.left.key:
                            y = t.left
                            t.left = y.right
                            y.right = t
                            t = y
                            if t.left == None:
                                break
                        r.left = t
                        r = t
                        t = t.left
                    elif key > t.key:
                        if t.right == None:
                            break
                        if key > t.right.key:
                            y = t.right
                            t.right = y.left
                            y.left = t
                            t = y
                            if t.right == None:
                                break
                        l.right = t
                        l = t
                        t = t.right
                    else:
                        break
                l.right = t.left
                r.left = t.right
                t.left = self.header.right
                t.right = self.header.left
                self.root = t