题目描述
blablabla
样例
blablabla
算法1
笨办法
- 中序遍历BST得到数组
- 再遍历数组得到最优解
blablabla
时间复杂度
参考文献
Python 3 代码
# Definition for a binary tree node.
# class TreeNode(object):
# def __init__(self, x):
# self.val = x
# self.left = None
# self.right = None
class Solution(object):
def closestValue(self, root, target):
"""
:type root: TreeNode
:type target: float
:rtype: int
"""
self.ans = []
self.inorder(root)
temp = float('inf')
ret = 0
for i,value in enumerate(self.ans):
a = abs(value-target)
if a <temp:
temp = a
ret = value
return (ret)
def inorder(self, root):
if not root:
return
self.inorder(root.left)
self.ans.append(root.val)
self.inorder(root.right)