Golang反转二叉树
反转二叉树 type NoteTree struct { Val int left *NoteTree right *NoteTree } // 从根部往下,依次递归反转 func reverse_notetree(root *NoteTree) *NoteTree { if root == nil{ return nil } left := reverse_notetree(root.left) right := reverse_notetree(root.right) root.left =...阅读全文