We read every piece of feedback, and take your input very seriously.
To see all available qualifiers, see our documentation.
There was an error while loading. Please reload this page.
1 parent a0314c6 commit 0c46250Copy full SHA for 0c46250
src/main/kotlin/g2401_2500/s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level/Solution.kt
@@ -1,7 +1,7 @@
1
package g2401_2500.s2471_minimum_number_of_operations_to_sort_a_binary_tree_by_level
2
3
// #Medium #Breadth_First_Search #Tree #Binary_Tree
4
-// #2025_03_14_Time_117_ms_(100.00%)_Space_72.60_MB_(_%)
+// #2023_07_05_Time_789_ms_(100.00%)_Space_63.6_MB_(100.00%)
5
6
import com_github_leetcode.TreeNode
7
import java.util.ArrayDeque
0 commit comments