530.二叉搜索树的最小绝对差
题目链接/文章讲解:代码随想录
关键:二叉搜索树特点,中序遍历即按照升序排列
方法1:遍历二叉树,用数组记录元素,因为数组按升序排列,故计算相邻元素之间的差值即可得到最小的绝对差
方法2:遍历过程中,使用两个指针,分别记录当前元素,和当前元素的前一个元素,同时更新结果值,得到最小的绝对差
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def __init__(self):
self.result = float('inf')
self.pre = None
def dfs(self,cur):
if cur is None:
return
self.dfs(cur.left)
if self.pre is not None:
self.result = min(self.result,cur.val - self.pre.val)
self.pre = cur
self.dfs(cur.right)
def getMinimumDifference(self, root: Optional[TreeNode]) -> int:
"""
中序遍历 双指针 记录两个节点之间的差值
"""
self.dfs(root)
return self.result
501.二叉搜索树中的众数
方法1:采用任何遍历顺序得到各节点的值,存储在数组中,然后用字典记录数组中元素及出现次数,最后返回次数最多的元素
方法2:采用中序遍历,双指针来比较当前元素与其前一个元素是否相同,采用一个变量来记录元素出现的次数,列表记录元素
# Definition for a binary tree node.
# class TreeNode:
# def __init__(self, val=0, left=None, right=None):
# self.val = val
# self.left = left
# self.right = right
class Solution:
def __init__(self):
self.result = []
self.count = 0
self.maxcount = 0
self.pre = None
def dfs(self,cur):
if cur is None:
return
self.dfs(cur.left)
if self.pre is None:
self.count = 1
elif self.pre.val == cur.val:
self.count += 1
else:
self.count = 1
self.pre = cur
if self.count == self.maxcount:
self.result.append(cur.val)
if self.count > self.maxcount:
self.result = [cur.val]
self.maxcount = self.count
self.dfs(cur.right)
def findMode(self, root: Optional[TreeNode]) -> List[int]:
self.dfs(root)
return self.result