二叉树的下一个结点 牛客网 剑指Offer

牛客网 剑指Offer

• 题目描述
• 给定一个二叉树和其中的一个结点，请找出中序遍历顺序的下一个结点并且返回。注意，树中的结点不仅包含左右子结点，同时包含指向父结点的指针。

# class TreeLinkNode:
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.next = None
class Solution:
    #run:35ms memory:5724k
    def GetNext(self, pNode):
        if pNode == None:
            return 
        pNext = None
        if pNode.right != None:
            pRight = pNode.right
            while pRight.left !=None:
                pRight = pRight.left
            pNext = pRight
        elif pNode.next != None:
            pCurrent = pNode
            pParent = pNode.next
            while pParent != None and pCurrent == pParent.right:
                pCurrent = pParent
                pParent = pParent.next
            pNext = pParent
        return pNext