diff options
author | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
---|---|---|
committer | Jack Sangdahl <[email protected]> | 2025-06-27 12:23:02 -0600 |
commit | a96b65cbfad7f62f3db6b2eab105e4e25c0414c5 (patch) | |
tree | e2a2b3f49f9fb741be81415266ac93e74cff42ec /other/lowest_common_ancestor_bst.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/lowest_common_ancestor_bst.cpp')
-rw-r--r-- | other/lowest_common_ancestor_bst.cpp | 17 |
1 files changed, 0 insertions, 17 deletions
diff --git a/other/lowest_common_ancestor_bst.cpp b/other/lowest_common_ancestor_bst.cpp deleted file mode 100644 index d496c2c..0000000 --- a/other/lowest_common_ancestor_bst.cpp +++ /dev/null @@ -1,17 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - TreeNode *lowestCommonAncestor(TreeNode *root, TreeNode *p, TreeNode *q) { - int small = min(p->val, q->val), large = max(p->val, q->val); - while (root != nullptr) { - if (root->val > large) - root = root->left; - else if (root->val < small) - root = root->right; - else - return root; - } - return nullptr; - } -}; |