diff options
author | Jack Sangdahl <[email protected]> | 2025-02-03 15:37:19 -0700 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-02-03 15:37:19 -0700 |
commit | 55a67f776dd9acd258cae16ffb636751666b0f40 (patch) | |
tree | 601539de43809b70ceb8228a12c35883fa300b03 /increasing_seach_tree.cpp | |
parent | a0030873dabb517594ae0394350d6715071f7fb8 (diff) | |
download | leetcode-55a67f776dd9acd258cae16ffb636751666b0f40.tar.gz leetcode-55a67f776dd9acd258cae16ffb636751666b0f40.zip |
chore: Remove incomplete solutions
Diffstat (limited to 'increasing_seach_tree.cpp')
-rw-r--r-- | increasing_seach_tree.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/increasing_seach_tree.cpp b/increasing_seach_tree.cpp deleted file mode 100644 index cfe97ec..0000000 --- a/increasing_seach_tree.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - TreeNode *increasingBST(TreeNode *root) { - TreeNode *temp; - TreeNode *ans = new TreeNode(); - temp = ans; - inOrder(ans, root); - return temp->right; - } - -private: - void inOrder(TreeNode *&ans, TreeNode *root) { - if (!root) - return; - inOrder(ans, root->left); - ans->right = new TreeNode(root->val); - ans = ans->right; - inOrder(ans, root->right); - } -}; - -int main() {} |