菜鸟笔记-1

来源：互联网发布：全国高校校花知乎编辑：程序博客网时间：2024/06/14 18:08

第一天：一个只有一半的tree

class BSTNode(object):    def __init__(self,data):        self.data = data        self.left = None        self.right = None    def isLeaf(self):        return not(self.left or self.right)    def find(self,n):        if self.data == None:            return False        else:            if self.data > n:                if self.left == None:                    return False                else:                    return self.left.find(n)            elif self.data < n:                if self.right == None:                    return False                else:                    return self.right.find(n)            else:                return True    def delete(self,x):if self.root == None:    return Nonereturn self.__delete(self.root,x)    def __delete(self,node,x):if x > node.getData():            node.setRight(self.__delete(node.getRight(),x))elif x < node.getData():    node.setLeft(self.__delete(node.getLeft(),x))else:                    def inOrder(self):        if self.isLeaf():            print self.data        else:            self.left.inOrder()            print self.data            self.right.inOrder()                def preOrder(self):        if self.isLeaf():            print self.data        else:            print self.data            self.left.inOrder()            self.right.inOrder()                def preOrder(self):        if self.isLeaf():            print self.data        else:            self.left.inOrder()            self.right.inOrder()            print self.data

0 0