@ -1,5 +1,12 @@
package correct
import (
"fmt"
"io"
"math/rand"
"strconv"
)
type TNode struct {
Val int
Left *TNode
@ -22,7 +29,6 @@ func InvertTree(root *TNode) *TNode {
return root
}
type stuNode = TNode
type solNode = correct.TNode
@ -1,5 +1,10 @@
type TreeNodeM struct {
Left *TreeNodeM
@ -19,7 +24,6 @@ func MergeTrees(t1 *TreeNodeM, t2 *TreeNodeM) *TreeNodeM {
return t1
type stuTreeNode = TreeNodeM
type solTreeNode = correct.TreeNodeM
type TreeNodeL struct {
Left *TreeNodeL
@ -23,7 +28,6 @@ func checkIfEq(t1 *TreeNodeL, t2 *TreeNodeL) bool {
return t1.Val == t2.Val && checkIfEq(t1.Right, t2.Right) && checkIfEq(t1.Left, t2.Left)
type stuTreeNode = TreeNodeL
type solTreeNode = correct.TreeNodeL
@ -1,5 +1,7 @@
import "strconv"
type Nodelist struct {
Data int
Next *Nodelist
@ -32,7 +34,6 @@ func moveValue(l *Nodelist, cmp func(a, b int) bool) *Nodelist {
return ret
func listToString4(n *correct.Nodelist) (res string) {
it := n
for it != nil {