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/leaf_similar_trees.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/leaf_similar_trees.cpp')
-rw-r--r-- | other/leaf_similar_trees.cpp | 28 |
1 files changed, 0 insertions, 28 deletions
diff --git a/other/leaf_similar_trees.cpp b/other/leaf_similar_trees.cpp deleted file mode 100644 index 319fbbf..0000000 --- a/other/leaf_similar_trees.cpp +++ /dev/null @@ -1,28 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - bool leafSimilar(TreeNode *root1, TreeNode *root2) { - stack<TreeNode *> s1, s2; - s1.push(root1); - s2.push(root2); - while (!s1.empty() && !s2.empty()) - if (dfs(s1) != dfs(s2)) - return false; - return s1.empty() && s2.empty(); - } - -private: - int dfs(stack<TreeNode *> &s) { - while (true) { - TreeNode *node = s.top(); - s.pop(); - if (node->right) - s.push(node->right); - if (node->left) - s.push(node->left); - if (!node->left && !node->right) - return node->val; - } - } -}; |