python基础--单链表的实现

最新推荐文章于 2024-10-01 05:04:32 发布

microsoft chatgpt

最新推荐文章于 2024-10-01 05:04:32 发布

阅读量292

点赞数

分类专栏： python 文章标签： python 开发语言

本文链接：https://blog.csdn.net/qq_41555580/article/details/128251519

版权

python 专栏收录该内容

5 篇文章 0 订阅

订阅专栏

class TreeNode:
    def __init__(self, val=0, left=None, right=None):
        self.val = val
        self.left = left
temps1=TreeNode()
temps2=TreeNode()
def deletetList(treenode:TreeNode,locate:int):
    if locate>0:
        locate1=locate-1
        deletetList(treenode.left,locate1)
        if locate1==0:
            global temps1
            temps1=treenode.left
            print("temps1:", temps1.val)
        if locate1==1:
            global temps2
            temps2= treenode
            print("temps2:", temps2.val)
            treenode.left=temps1
    return
def creatList(treenode:TreeNode,a:int):
    if a>0:
        treenode.val=input("请输入：")
        treenode1=TreeNode()
        treenode.left=treenode1
        print("保存结点！")
        s=a-1
        creatList(treenode1,s)
def getList(treenode:TreeNode):
    if treenode.left!=None:
        print(treenode.val)
        getList(treenode.left)
    return
def uodateList(treenode:TreeNode,locate:int,key):
    if locate>0:
        locate=locate-1
        uodateList(treenode.left,locate,key)
        if locate==0:
            treenode.val = key
    return
def insertList(treenode:TreeNode,locate:int,key):
    if locate>0:
        locate=locate-1
        insertList(treenode.left,locate,key)
        if locate==1:
            t1=TreeNode()
            t1.val=key
            temp=treenode.left
            treenode.left=t1
            t1.left=temp
    return
p=TreeNode()
print("输入存储的结点数：")
sss=int(input())
print("创建结点数为",sss,"的单链表")
creatList(p,sss)
getList(p)
uodateList(p,1,1)
getList(p)
print('插入后的新链表：')
insertList(p,3,33)
getList(p)
print("删除某个结点")
deletetList(p,3)
print('新链表：')
getList(p)