Commit 7a70a19

committed

BST show elements

1 parent d3a94a3 commit 7a70a19Copy full SHA for 7a70a19

File tree

+25

-12

lines changed

+25

-12

lines changed

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -5,7 +5,7 @@`
`5`	`5`
`6`	`6`	`![IMAGE](/img/bst.png)`
`7`	`7`
`8`		`-Binary Search Tree ADT Operations`
	`8`	`+Binary Search Tree ADT Operations:`
`9`	`9`	`* Insert(k): вставка элемента k в дерево.`
`10`	`10`	`* Delete(k): удаление элемента k.`
`11`	`11`	`* Search(k): поиск значения элемента k в структуре, есть он или нет.`

Lines changed: 23 additions & 11 deletions

Original file line number	Diff line number	Diff line change
`@@ -2,21 +2,17 @@ package main`
`2`	`2`
`3`	`3`	`import (`
`4`	`4`	`"fmt"`
`5`		`-`
`6`		`- "github.com/dreddsa5dies/algorithm/util"`
`7`	`5`	`)`
`8`	`6`
`9`	`7`	`func main() {`
`10`		`- list := util.RandomInt() // срез int`
`11`		`- fmt.Printf("List:\t%v\n", list)`
`12`		`-`
`13`	`8`	`tree := New()`
`14`		`- fmt.Println(tree)`
`15`		`- tree.Insert(10)`
`16`		`- tree.Insert(0)`
`17`		`- fmt.Println(tree.size)`
`18`		`- fmt.Println(tree.root)`
`19`		`- fmt.Println(tree)`
	`9`	`+ tree.Insert(15)`
	`10`	`+ tree.Insert(1)`
	`11`	`+ tree.Insert(2)`
	`12`	`+ tree.Insert(3)`
	`13`	`+ tree.Insert(1)`
	`14`	`+ tree.Insert(3)`
	`15`	`+ tree.Show()`
`20`	`16`	`}`
`21`	`17`
`22`	`18`	`// Node is a representation of a single node in tree. (recursive ADT)`
`@@ -78,3 +74,19 @@ func (tree *Bst) Insert(value int) {`
`78`	`74`	`tree.size++`
`79`	`75`	`tree.root.insert(&Node{value, nil, nil})`
`80`	`76`	`}`
	`77`	`+`
	`78`	`+// Show element in tree`
	`79`	`+func show(root *Node) {`
	`80`	`+ if root != nil {`
	`81`	`+ show(root.left)`
	`82`	`+ fmt.Println(root.key)`
	`83`	`+ show(root.right)`
	`84`	`+ }`
	`85`	`+}`
	`86`	`+`
	`87`	`+// Show all elements`
	`88`	`+func (tree *Bst) Show() {`
	`89`	`+ if tree.root != nil {`
	`90`	`+ show(tree.root)`
	`91`	`+ }`
	`92`	`+}`

Lines changed: 1 addition & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -15,6 +15,7 @@`
`15`	`15`	`* Breadth-first search, BFS (Поиск в ширину (англ. breadth-first search, BFS) — метод обхода графа и поиска пути в графе): [example](https://github.com/dreddsa5dies/algorithm/tree/master/BFS)`
`16`	`16`	`* Stack (абстрактный тип данных, представляющий собой список элементов, организованных по принципу LIFO): [example](https://github.com/dreddsa5dies/algorithm/tree/master/stack)`
`17`	`17`	`* Queue (абстрактный тип данных, представляющий собой список элементов, организованных по принципу FIFO): [example](https://github.com/dreddsa5dies/algorithm/tree/master/queue)`
	`18`	`+* binary search tree, BST (Двоичное дерево поиска): [example](https://github.com/dreddsa5dies/algorithm/tree/master/BST)`
`18`	`19`	`## The code contains comments in Russian`
`19`	`20`
`20`	`21`	`## License`

Comments

(0)