Random Notes & Thoughts on CS/ML/DL/CV

@[TOC](Queue (Linked & Sequential) in Python) 1. Node class Node: def __init__(self, data): self.data = data self.next = None def __eq__(self, data): return self.data == data def __str__(self): return str(s

Linked Stack in Python1. Node2. Stack3. Test Codes 1. Node class Node: def __init__(self, data): self.data = data self.next = None def __str__(self): return str(self.data) 2. Stack class Stack: def __init__(self):

Circular Linked List in Python1. Node2. Circular Linked List3. Test Codes 1. Node class Node: def __init__(self, data): self.data = data self.next = None def __eq__(self, data): return self.data == data def __str__

Doubly Linked List in Python1. 结点定义2. 双向链表的实现3. 测试程序 1. 结点定义 class Node: def __init__(self, data): self.data = data self.prev = None self.next = None def __eq__(self, data): return self.data == data def __str__

单链表的Python语言实现1. 结点定义2. 单链表实现3. 测试程序 1. 结点定义 class Node: def __init__(self, data): self.data = data self.next = None def __str__(self): return str(self.data) 2. 单链表实现 class SinglyLinkedList: def __init__(self):