类中的递归

Question

我试图在类语句中放置递归公式

class SomeNode:

    def __init__(self, a):
        leng = len(a)
        half= leng/2
        self.firstnode=a[0][0]
        self.child1=SomeNode([a[i]for k in range(leng)])
        self.child2=SomeNode([a[j] for j in range(leng)])


    def recursfunc(self):
        print self.firstnode
        recursfunc(self.child1)
        recursfunc(self.child2)

但是，我一直收到错误消息name error:未定义全局名称“recursfunc”

Answer 1

def tri_recursion(k):
  if(k>0):
    result = k+tri_recursion(k-1)
    print(result)
  else:
    result = 0
  return result

print("\n\nRecursion Example Results")
tri_recursion(7)

Answer 2

你需要使用self.recursfunc()