数据结构第十章笔记

数据结构笔记

---

---

第十章

二叉查找树及操作

二叉查找树的性质：

二叉查找树实现及算法分析

其中，3，4，6，2是key，颜色是 value。

class BinarySearchTree:
    def __init__(self):
        self.root = None
        self.size = 0
        
    def length(self):
        return self.size
    
    def __len__(self):    #使用了这个方法可以用 len（BinarySearchTree）了
        return self.size
    
    def __iter__(self):   #使用了这个方法就可以迭代了
        return self.root.__iter__()
    
    def put(self,key,val):
        if self.root:
            self._put(key,val,self.root)
        else:
            self.root = TreeNode(key,val)
        self.size += 1
        
    def _put(self,key,val,currentNode):
        if key < currentNode.key:
            if currentNode.hasLeftChild():
                self._put(key,val,currentNode.leftChild)   #参数内的self只有定义时需要有，调用时不需要
            else:
                currentNode.leftChild = TreeNode(key,val,parent = currentNode)
        else:
            if currentNode.hasRightChild():
                self._put(key,val,currentNode.rightChild)
            else:
                currentNode.rightChild = TreeNode(key,val,parent = currentNode)
      
    def __setitem__(self,k,v):  #这样就可以使用 BinarySearchTree[key] = value了
        self.put(k,v)
    
    def __getitem__(self,key):
        return self.get(key)
    
    def __contains__(self,key):
        if self._get(key,self.root):
            return True
        else:
            return False
    
    def get(self,key):
        if self.root:
            res = self._get(key,self.root)
            if res:
                return res.payload
            else:
                return None
        else:
            return None
            
    def _get(self,key,currentNode):
        if not currentNode:
            return None
        elif currentNode.key == key:
            return currentNode
        elif currentNode.key > key:
            return self._get(key,currentNode.leftChild) 
        else:
            return self._get(key,currentNode.rightChild)
        
    def __delitem__(self,key):
        self.delete(key)
        
        
    def delete(self,key):
        if self.size > 1:
            nodeToRemove = self._get(key,self.root)
            if nodeToRemove:
                self.remove(nodeToRemove)
                self.size -= 1
            else:
                raise KeyError('Error , key not in tree')
        elif self.size == 1 and self.root.key == key:
            self.root = None
            self.size -= 1
        else:
            raise KeyError('Error , key not in tree')
    
    def remove(self,key):
        pass
            
            
class TreeNode:
    def __init__(self,key,value,left=None,right=None,parent=None):
        self.key = key
        self.payload = value
        self.leftChild = left
        self.rightChild = right
        self.parent = parent
        
    def hasLeftChild(self):
        return self.leftChild
    
    def hasRightChild(self):
        return self.rightChild
    
    def isLeftChild(self):
        return self.parent and self.parent.leftChild == self
    
    def isRightChild(self):
        return self.parent and self.parent.rightChild == self
    
    def isRoot(self):
        return not self.parent
    
    def isLeaf(self):
        return not (self.rightChild and self.leftChild)
    
    def hasAnyChildren(self):
        return self.rightChild or self.leftChild
    
    def hasBothChildren(self):
        return self.leftChild and self.rightChild
    
    def replaceNodeData(self,key,value,lc,rc): #一般不用
        self.key = key
        self.payload = value
        self.leftChild = lc
        self.rightChild = rc
        if self.hasLeftChild():
            self.leftChild.parent = self
        if self.hasRightChild():
            self.rightChild.parent = self
            
    def __iter__(self):
       if self:
           if self.hasLeftChild():
               for item in self.leftChild:
                   yield item
           yield self.key
           if self.hasRightChild():
               for item in self.rightChild:
                   yield item

AVL树的定义和性能

树结构小结

注：散列冲突使得散列表的时间复杂度到O(n)