def find_level(parent, i):
    cnt = 1
    while parent[i] != -1:
        cnt += 1
        i = parent[i]
    return cnt

class FNode():
    def __init__(self,name=None,i=None):#name為數(shù)據(jù),i為其對(duì)應(yīng)的父節(jié)點(diǎn)下標(biāo)
        self.node=[name,i]
class ftree():#存儲(chǔ)節(jié)點(diǎn)數(shù)據(jù)
    def __init__(self):
        self.data=[]
    #增加
    def add(self,name,i):#添加節(jié)點(diǎn)數(shù)據(jù)進(jìn)入數(shù)的結(jié)構(gòu)
        p = FNode(name,i)#建立節(jié)點(diǎn)
        self.data.append(p.node)#添加進(jìn)入
    #創(chuàng)建
    def CreateTree(self,arr):#傳入對(duì)應(yīng)數(shù)據(jù)建立數(shù)arr為一個(gè)樹(shù)關(guān)系的二維列表
        for i in arr:
            self.data.append(i)
    #刪除
    def Dex(self,name,i):#給出節(jié)點(diǎn)的name和i進(jìn)行刪除
        for j in range(len(self.data)):
            if self.data[j][0]==name and self.data[j][1]==i:
                self.data.pop(j)
                break
    # 修改節(jié)點(diǎn)數(shù)據(jù)
    def alter(self,name,i,n_name):
        for j in range(len(self.data)):
            if self.data[j][0]==name and self.data[j][1]==i:
                self.data[j][0]=n_name
                break
    #查找節(jié)點(diǎn)
    def find(self,name,i):
        for j in range(len(self.data)):
            if self.data[j][0]==name and self.data[j][1]==i:
                return self.data[j]

    #遍歷樹(shù)結(jié)構(gòu),雙親存儲(chǔ)單位的結(jié)構(gòu)決定了它只能層次遍歷
    def display(self):
        for i in range(len(self.data)):
            print(self.data[i][0],end=" ")
        print()

t = [['A',-1],['B',0],['C',0],['D',1],['E',1],['F',1],['G',4]]
tree_1 = ftree()
tree_1.CreateTree(t)
tree_1.display()
tree_1.add('H',4)
tree_1.display()
tree_1.Dex('H',4)
tree_1.display()
tree_1.alter('G',4,'5')
tree_1.display()
print(tree_1.find('A',-1))