aboutsummaryrefslogtreecommitdiff
path: root/min_abs_diff_bst.cpp
diff options
context:
space:
mode:
Diffstat (limited to 'min_abs_diff_bst.cpp')
-rw-r--r--min_abs_diff_bst.cpp27
1 files changed, 0 insertions, 27 deletions
diff --git a/min_abs_diff_bst.cpp b/min_abs_diff_bst.cpp
deleted file mode 100644
index 0c0ef82..0000000
--- a/min_abs_diff_bst.cpp
+++ /dev/null
@@ -1,27 +0,0 @@
-// 530. Minimum Absolute Difference in BST
-#include "leetcode.h"
-
-/*
- * 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
- */
-
-class Solution {
- int diff = INT_MAX;
- TreeNode *prev = NULL;
- void dfs(TreeNode *root) {
- if (root->left)
- dfs(root->left);
- if (prev)
- diff = min(diff, abs(prev->val - root->val));
- prev = root;
- if (root->right)
- dfs(root->right);
- }
-
-public:
- int getMinimumDifference(TreeNode *root) {
- dfs(root);
- return diff;
- }
-};