From a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 Mon Sep 17 00:00:00 2001 From: Jack Sangdahl Date: Fri, 27 Jun 2025 12:23:02 -0600 Subject: chore: remove old cpp and rust solutions --- other/convert_sorted_bst.cpp | 29 ----------------------------- 1 file changed, 29 deletions(-) delete mode 100644 other/convert_sorted_bst.cpp (limited to 'other/convert_sorted_bst.cpp') diff --git a/other/convert_sorted_bst.cpp b/other/convert_sorted_bst.cpp deleted file mode 100644 index 8b5b656..0000000 --- a/other/convert_sorted_bst.cpp +++ /dev/null @@ -1,29 +0,0 @@ -// 109. Convert Sorted List to Binary Search Tree -#include "leetcode.h" - -/* - * given 'head' of a singly linked list where elements are sorted in ascending - * order convert it to a height balanced binary search tree. meaning the depth - * of two sub- trees of every node never differs by more than one. - */ - -class Solution { -public: - TreeNode *sortedListToBST(ListNode *head) { - if (!head) - return NULL; - if (!head->next) - return new TreeNode(head->val); - auto slow = head, fast = head, pre = head; - while (fast && fast->next) { - pre = slow; - slow = slow->next; - fast = fast->next->next; - } - pre->next = 0; - TreeNode *root = new TreeNode(slow->val); - root->left = sortedListToBST(head); - root->right = sortedListToBST(slow->next); - return root; - } -}; -- cgit v1.2.3