aboutsummaryrefslogtreecommitdiff
path: root/other/min_dist_bst_node.cpp
diff options
context:
space:
mode:
authorJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
committerJack Sangdahl <[email protected]>2025-06-27 12:23:02 -0600
commita96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch)
treee2a2b3f49f9fb741be81415266ac93e74cff42ec /other/min_dist_bst_node.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/min_dist_bst_node.cpp')
-rw-r--r--other/min_dist_bst_node.cpp20
1 files changed, 0 insertions, 20 deletions
diff --git a/other/min_dist_bst_node.cpp b/other/min_dist_bst_node.cpp
deleted file mode 100644
index 5222628..0000000
--- a/other/min_dist_bst_node.cpp
+++ /dev/null
@@ -1,20 +0,0 @@
-// 783. Minimum Distance Between BST Nodes
-#include "leetcode.h"
-
-// given the 'root' of BST, return the minimum difference between the values
-// of any two different nodes in the tree!
-
-class Solution {
-public:
- int ans = INT_MAX, pre = -1;
- int minDiffInBST(TreeNode *root) {
- if (root->left != NULL)
- minDiffInBST(root->left);
- if (pre >= 0)
- ans = min(ans, root->val - pre);
- pre = root->val;
- if (root->right != NULL)
- minDiffInBST(root->right);
- return ans;
- }
-};