题目:
给定一个二叉树和其中的一个结点,请找出中序遍历顺序的下一个结点并且返回。注意,树中的结点不仅包含左右子结点,同时包含指向父结点的指针。
思路一:
暴力解法
代码:
# class TreeLinkNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# self.next = None
class Solution:
def GetNext(self, pNode):
root = pNode
while root.next: root = root.next
arr = self.trans(root)
index = arr.index(pNode)
return arr[index+1] if index<len(arr)-1 else None
def trans(self, root):
if not root: return []
arr = []
arr.extend(self.trans(root.left))
arr.append(root)
arr.extend(self.trans(root.right))
return arr
思路二:
穷举
代码:
# class TreeLinkNode:
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
# self.next = None
class Solution:
def GetNext(self, pNode):
if pNode.right:
p = pNode.right
while p.left: p = p.left
return p
while pNode.next:
if pNode == pNode.next.left: return pNode.next
pNode = pNode.next
return None