貌似Python標(biāo)準(zhǔn)庫(kù)并沒提供對(duì)樹的操作，這是基本的數(shù)據(jù)結(jié)構(gòu)操作，用遞歸很容易實(shí)現(xiàn)：
def tree_find(tree, value):
def tree_rec(tree, iseq):
if isinstance(tree, list):
for i, child in enumerate(tree):
r = tree_rec(child, iseq + [i])
if r is not None:
return r
elif tree == value:
return iseq
else:
return None