Python-AVL树
摘要：查看代码 class BiTreeNode: def __init__(self, data): self.data = data self.lchild = None # 左孩子 self.rchild = None # 右孩子 self.parent = None class BST: def
阅读全文
posted @ 2023-02-01 15:27
文章分类 - Python基本数据结构
Python-二叉搜索树
摘要：class BiTreeNode: def __init__(self, data): self.data = data self.lchild = None # 左孩子 self.rchild = None # 右孩子 self.parent = None class BST: def __ini
阅读全文
posted @ 2023-02-01 15:20
Python-二叉树
摘要：from collections import deque class BiTreeNode: def __init__(self, data): self.data = data self.lchild = None # 左孩子 self.rchild = None # 右孩子 a = BiTre
阅读全文
posted @ 2023-02-01 15:17
Python-树
摘要：树实例：模拟文件系统 class Node: def __init__(self, name, type='dir'): self.name = name self.type = type # 'dir' or 'file' self.children = [] self.parent = None
阅读全文
posted @ 2023-02-01 15:14
Python-哈希表
摘要：class LinkList: class Node: def __init__(self, item=None): self.item = item self.next = None class LinkListIterator: def __init__(self, node): self.no
阅读全文
posted @ 2023-02-01 15:11
Python-链表
摘要：class Node: def __init__(self, item): self.item = item self.next = None def create_linklist_head(li): # 头插法：从链表的表头开始插入，每插入一个数，表头都会变成当前的这个数 head = Node
阅读全文
posted @ 2023-02-01 15:09
Python-迷宫问题-使用队列解决迷宫问题
摘要：from collections import deque maze = [ [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 1, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 0,
阅读全文
posted @ 2023-02-01 15:02
Python-迷宫问题-使用栈解决迷宫问题
摘要：# 迷宫 maze = [ [1, 1, 1, 1, 1, 1, 1, 1, 1, 1], [1, 0, 1, 1, 1, 1, 0, 1, 1, 1], [1, 0, 1, 1, 1, 1, 0, 1, 0, 1], [1, 0, 1, 0, 0, 0, 0, 0, 0, 1], [1, 0, 0
阅读全文
posted @ 2023-02-01 15:00
Python-队列
摘要：注：当front == rear时，判断为空队列！ class Queue: def __init__(self, size=100): self.queue = [0 for _ in range(size)] self.size = size self.rear = 0 # 队尾指针 self.
阅读全文
posted @ 2023-02-01 14:56
Python-栈
摘要：查看代码 class Stack: def __init__(self): self.stack = [] def push(self, element): self.stack.append(element) def pop(self): return self.stack.pop() def g
阅读全文
posted @ 2023-02-01 14:53
