Name	Name	Last commit message	Last commit date
parent directory ..
Solution.playground	Solution.playground
Makefile	Makefile
README.md	README.md
Solution.swift	Solution.swift
main.cpp	main.cpp

Name

Last commit message

Last commit date

Minimum Absolute Difference in BST

Given a binary search tree with non-negative values, find the minimum absolute difference between values of any two nodes.

Example:

Input:

1
3 / 2

Output: 1

Explanation: The minimum absolute difference is 1, which is the difference between 2 and 1 (or between 2 and 3).

Solutions:

O(n)

O(n)

Run make to build and run C++ files and run Swift files. Or you can run .playground file.