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/binary_tree_right_view.cpp | |
parent | 694ad5ed71edcb1deccab54b72d706b779918276 (diff) | |
download | leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.tar.gz leetcode-a96b65cbfad7f62f3db6b2eab105e4e25c0414c5.zip |
chore: remove old cpp and rust solutions
Diffstat (limited to 'other/binary_tree_right_view.cpp')
-rw-r--r-- | other/binary_tree_right_view.cpp | 24 |
1 files changed, 0 insertions, 24 deletions
diff --git a/other/binary_tree_right_view.cpp b/other/binary_tree_right_view.cpp deleted file mode 100644 index e5a040c..0000000 --- a/other/binary_tree_right_view.cpp +++ /dev/null @@ -1,24 +0,0 @@ -#include "leetcode.h" - -class Solution { -public: - vector<int> rightSideView(TreeNode *root) { - queue<TreeNode *> q; - vector<int> ans; - if (!root) - return ans; - q.push(root); - while (!q.empty()) { - ans.push_back(q.back()->val); - for (int i = q.size(); i > 0; i--) { - TreeNode *n = q.front(); - q.pop(); - if (n->left) - q.push(n->left); - if (n->right) - q.push(n->right); - } - } - return ans; - } -}; |