Closest Binary Search Tree Value | Leetcode 270

preview_player
Показать описание
Problem Title:
Closest Binary Search Tree Value

Difficulty:
Easy

Category:
Tree/BinarySearchTree/Recursion

Link:

Description:
Given the root of a binary search tree and a target value, return the value in the BST that is closest to the target. If there are multiple answers, print the smallest.

About me:
I am starting my journey to solve and learn data structures fundamental concepts.
Рекомендации по теме
visit shbcf.ru