题目描述

blablabla

样例

blablabla

算法1

() $O(n^2)$

blablabla

时间复杂度分析：blablabla

python 代码

# Definition for a binary tree node.
# class TreeNode(object):
#     def __init__(self, x):
#         self.val = x
#         self.left = None
#         self.right = None
#         self.father = None
class Solution(object):
    def inorderSuccessor(self, q):
        """
        :type q: TreeNode
        :rtype: TreeNode
        """
        if q.right:
            q = q.right
            while q.left:
                q = q.left
            return q
        while q.father and q == q.father.right:
            q = q.father
        return q.father