-
Notifications
You must be signed in to change notification settings - Fork 0
/
General2BinaryTree.go
62 lines (53 loc) · 1.13 KB
/
General2BinaryTree.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
/**
*
* @Name: General Tree To Binary Tree
* @Author: Max Base
* @Date: 2022/12/17
* @Repository: https://github.com/BaseMax/General2BinaryTree
* @License: GPL-3
*
*/
package main
import "fmt"
type BinaryNode struct {
data interface{}
left *BinaryNode
right *BinaryNode
}
type Node struct {
data interface{}
child []*Node
}
type GeneralTree struct {
root *Node
}
type BinaryTree struct {
root *BinaryNode
}
func (t *GeneralTree) General2BinaryTree() *BinaryTree {
return &BinaryTree{root: general2BinaryTree(t.root)}
}
func printBinaryTree(root *BinaryNode, level int) {
if root == nil {
return
}
for i := 0; i < level; i++ {
fmt.Print(" ")
}
fmt.Println(root.data)
printBinaryTree(root.left, level+1)
printBinaryTree(root.right, level+1)
}
func general2BinaryTree(root *Node) *BinaryNode {
if root == nil {
return nil
}
binaryRoot := &BinaryNode{data: root.data}
if len(root.child) > 0 {
binaryRoot.left = general2BinaryTree(root.child[0])
}
if len(root.child) > 1 {
binaryRoot.right = general2BinaryTree(root.child[1])
}
return binaryRoot
}