剑指offer-二叉树的下一个结点之python实现

 

class Solution:
    def GetNext(self, node):
        if node == None:
            return None
        if node.right:
            node = node.right
            while node.left:
                node = node.left
            return node 
        while node.next != None:
            if node.next.left == node:
                return node.next
            else:
                node = node.next
        return None