aboutsummaryrefslogtreecommitdiff
path: root/other/binary_tree_inorder.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/binary_tree_inorder.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/binary_tree_inorder.cpp')
-rw-r--r--other/binary_tree_inorder.cpp23
1 files changed, 0 insertions, 23 deletions
diff --git a/other/binary_tree_inorder.cpp b/other/binary_tree_inorder.cpp
deleted file mode 100644
index a677d27..0000000
--- a/other/binary_tree_inorder.cpp
+++ /dev/null
@@ -1,23 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- vector<int> inorderTraversal(TreeNode *root) {
- vector<int> ans;
- stack<TreeNode *> s;
- TreeNode *curr = root;
- while (curr || !s.empty()) {
- while (curr) {
- s.push(curr);
- curr = curr->left;
- }
- curr = s.top();
- s.pop();
- ans.push_back(curr->val);
- curr = curr->right;
- }
- return ans;
- }
-};
-
-int main() { Solution obj; }