Try   HackMD

530.Minimum Absolute Difference in BST

tags: Easy,Tree,DFS,BFS,Binary Search Tree,Binary Tree

530. Minimum Absolute Difference in BST

題目描述

Given the root of a Binary Search Tree (BST), return the minimum absolute difference between the values of any two different nodes in the tree.

範例

Example 1:

Image Not Showing Possible Reasons
  • The image file may be corrupted
  • The server hosting the image is unavailable
  • The image path is incorrect
  • The image format is not supported
Learn More → 

Input: root = [4,2,6,1,3]
Output: 1

Example 2:

Image Not Showing Possible Reasons
  • The image file may be corrupted
  • The server hosting the image is unavailable
  • The image path is incorrect
  • The image format is not supported
Learn More → 

Input: root = [1,0,48,null,null,12,49]
Output: 1

Constraints:

  • The number of nodes in the tree is in the range [2, 104].
  • 0 <= Node.val <= 105

Note: This question is the same as 783: https://leetcode.com/problems/minimum-distance-between-bst-nodes/

解答

Reference

回到題目列表

Last changed by 
 
Marsgoat
0
34
Published on HackMD