go语言实现二叉树的基本操作

package main

import "fmt"

type TreeNode struct {
	data interface{}
	Lchild *TreeNode
	Rchild *TreeNode
}
func CreatTree() *TreeNode{
	nums:=0
	fmt.Scan(&nums)
	if nums==0{
		return nil
	}
	root:=&TreeNode{
		data:nums,
	}
	root.Lchild=CreatTree()
	root.Rchild=CreatTree()
	return root
}
func (root *TreeNode) Preorder(){        //前序遍历
	if root==nil{ 
		return
	}
	fmt.Print(root.data)
	root.Lchild.Preorder()
	root.Rchild.Preorder()
}
func (root *TreeNode) InOrder(){            //中序遍历
	if root==nil{
		return
	}
	root.Lchild.InOrder()
	fmt.Print(root.data)
	root.Rchild.InOrder()
}
func (root *TreeNode) PostOrder(){            //后序遍历
	if root==nil{
		return
	}
	root.Lchild.PostOrder()
	root.Rchild.PostOrder()
	fmt.Print(root.data)
}
func main(){
	root:=CreatTree()
	fmt.Println(root)
	root.Preorder()
	fmt.Println()
	root.InOrder()
	fmt.Println()
	root.PostOrder()
}

C:\Users\my\go\src\hello\learn>go run test1.go
1 2 0 0 3 4 0 0 0
&{1 0xc04204a3e0 0xc04204a400}
1234
2143
2431