aboutsummaryrefslogtreecommitdiff
path: root/other/sorted_arrary_bst.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/sorted_arrary_bst.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/sorted_arrary_bst.cpp')
-rw-r--r--other/sorted_arrary_bst.cpp21
1 files changed, 0 insertions, 21 deletions
diff --git a/other/sorted_arrary_bst.cpp b/other/sorted_arrary_bst.cpp
deleted file mode 100644
index e859528..0000000
--- a/other/sorted_arrary_bst.cpp
+++ /dev/null
@@ -1,21 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- TreeNode *sortedArrayToBST(vector<int> &nums) {
- int start = 0, end = nums.size() - 1;
- TreeNode *root = helper(start, end, nums);
- return root;
- }
-
-private:
- TreeNode *helper(int start, int end, vector<int> &nums) {
- if (start > end)
- return NULL;
- int mid = start + (end - start) / 2;
- TreeNode *node = new TreeNode(nums[mid]);
- node->left = helper(start, mid - 1, nums);
- node->right = helper(mid + 1, end, nums);
- return node;
- }
-};