57.二叉树的下一个结点(python)

 1 class Solution:
 2     def GetNext(self, pNode):
 3         # write code here
 4         if pNode.right!=None:
 5             tmpNode = pNode.right
 6             while tmpNode.left:
 7                 tmpNode=tmpNode.left
 8             return tmpNode
 9         else:
10             tmpNode = pNode
11             while tmpNode.next:
12                 if tmpNode.next.left == tmpNode:
13                     return tmpNode.next
14                 else:
15                     tmpNode=tmpNode.next
16             return None