aboutsummaryrefslogtreecommitdiff
path: root/other/binary_tree_preorder.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_preorder.cpp
parent694ad5ed71edcb1deccab54b72d706b779918276 (diff)
downloadleetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz
leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/binary_tree_preorder.cpp')
-rw-r--r--other/binary_tree_preorder.cpp28
1 files changed, 0 insertions, 28 deletions
diff --git a/other/binary_tree_preorder.cpp b/other/binary_tree_preorder.cpp
deleted file mode 100644
index 7bba435..0000000
--- a/other/binary_tree_preorder.cpp
+++ /dev/null
@@ -1,28 +0,0 @@
-#include "leetcode.h"
-
-class Solution {
-public:
- vector<int> preorderTraversal(TreeNode *root) {
- // morris traversal
- vector<int> nodes;
- while (root) {
- if (root->left) {
- TreeNode *pre = root->left;
- while (pre->right && pre->right != root)
- pre = pre->right;
- if (!pre->right) {
- pre->right = root;
- nodes.push_back(root->val);
- root = root->left;
- } else {
- pre->right = NULL;
- root = root->right;
- }
- } else {
- nodes.push_back(root->val);
- root = root->right;
- }
- }
- return nodes;
- }
-};