CT数据结构优秀讲义.pptVIP

用Python的列表实现堆栈 class Stack : def __init__(self) : self.items = [] def push(self, item) : self.items.append(item) def pop(self) : return self.items.pop() def isEmpty(self) : return (self.items == []) s = Stack() s.push(54) s.push(45) s.push(+) while not s.isEmpty(): print s.pop(), 用Python实现链接队列 class Queue: def __init__(self): self.length = 0 self.head = None def isEmpty(self): return (self.length == 0) 用Python实现链接队列(续) class Queue: ... def insert(self, data): node = Node(data) node.next = None if self.head == None: self.head = node else: last = self.head while last.next: last = last.next last.next = node self.length = self.length + 1 def remove(self): data = self.head.data self.head = self.head.next self.length = self.length - 1 return data 链接队列的改进版本 class ImprovedQueue: def __init__(self): self.length = 0 self.head = None self.last = None def isEmpty(self): return (self.length == 0) 链接队列的改进版本(续) class ImprovedQueue: ... def insert(self, data): node = Node(data) node.next = None if self.length == 0: self.head = self.last = node else: last = self.last last.next = node self.last = node self.length = self.length + 1 链接队列的改进版本(续) class ImprovedQueue: ... def remove(self): data = self.head.data self.head = self.head.next self.length = self.length - 1 if self.length == 0: self.last = None return data Lu Chaojun, SJTU Lu Chaojun, SJTU 数据结构 Lu Chaojun, SJTU * Lu Chaojun, SJTU * * 链表 链表(linked list)可看作是一种递归数据结构. 链表定义为: 空列表(记为None), 或者 一个节点:包含一个数据对象和一个对链表的引用. 数据结构的递归定义使我们能很容易地写出递归方法来操作它们. Lu Chaojun, SJTU * Lu Chaojun, SJTU * * 节点与链接 节点类 class Node: def __ini