版权声明: https://blog.csdn.net/Wang_Jiankun/article/details/88679838
Python 实现链表和二叉树
1、链表
class Node:
def __init__(self, init_data):
self.data = init_data
self.next = None
def get_data(self):
return self.data
def get_next(self):
return self.next
def setData(self,new_data):
self.data = newdata
def setNext(self,new_next):
self.next = new_next
2、二叉树
# 树的结构
class BinaryTree:
def __init__(self,root):
self.key = root
self.leftChild = None
self.rightChild = None
# 树的前序遍历
def preorder(tree):
if tree:
print(tree.key)
preorder(tree.leftChild)
preorder(tree.rightChild)
GOOD LUCK!