go language study notes 4

Definition of go language structure

type student struct{name stringage int}

The structure of the go language is an object-oriented method, there is no this pointer, no method override and no extends

The structure is passed by value, and the copy is also a shallow copy.

The structure can implement a variety of data structures, which can be used as a list

For example

type node struct{val stringnext *node}

queue, stack, tree, etc. can be implemented with structures.

The structure pointer is named as follows

 list := new(node)//Life structure method one(*list).val = "123"(*list).next = &new(node)fmt.println((*list))list2 := &(node("456",&new(node)))fmt.println(list2)

The structure also has the attribute of slice mapping, and the address is the address of the first field

Algorithm title: How to restore a binary tree according to the preorder traversal of the search binary tree

package mainimport ("fmt")var array[10000]inttype bt struct {val intleft *btright *bt}var index int = 0func preOrder(root *bt) [10000]int {if root != nil {array[index] = root.valindex += 1preOrder(root.left)preOrder(root.right)}return array}func treeMain() {var root btroot.val = 10var left btvar right btleft.val = 5right.val = 15root.left = &leftroot.right = &rightvar arr[10000]int = preOrder(&root)var ans bt = reTree(&arr)fmt.Println(ans.left.val)}func reTree(preArr *[10000]int) bt {if len(preArr) <= 0 {var nilBoot btreturn nilBoot}var root btprocess1(preArr, 0, 1, 2, &root)return root}func process1(arrays *[10000]int, index int, L int, R int, ansTree *bt) {if L > len(array)-1 || R > len(array)-1 {return}ansTree.val = arrays[index]if arrays[L] < arrays[index] {var left btansTree.left = &leftprocess1(arrays, L, L+1, R, &left)}if arrays[R] > arrays[index] {var right btansTree.right = &rightprocess1(arrays, R, L, R+1, &right)}}