bars
📈
notes
search
circle-xmark
Ctrl
k
copy
Copy
chevron-down
0671_Second_Minimum_Node_In_a_Binary_Tree
Solution1 dfs
每层调用的 cur 是根节点的值。
利用 dfs 找到比 cur 大的第一个数
Previous
0671_Second_Minimum_Node_In_a_Binary_Tree
chevron-left
Next
0680_Valid_Palindrome_II
chevron-right
Last updated
4 years ago
Was this helpful?
Was this helpful?