Commit a7d1a46

committed

Breadth first search tree traversal

1 parent cc69d51 commit a7d1a46Copy full SHA for a7d1a46

File tree

+20

-7

lines changed

src/main/kotlin/pl/dmichalski/algorithms/data_structures
- _5_tree
  - Runner.kt
- _6_tree_traversal/_1_breadth_first_search
  - Runner.kt

+20

-7

lines changed

Lines changed: 13 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -18,11 +18,24 @@ object Runner {`
`18`	`18`	`println("Number $searchingNumber2 exists = $exists2")`
`19`	`19`	`}`
`20`	`20`
	`21`	`+ /**`
	`22`	`+ * It returns BST like this:`
	`23`	`+ * <pre>`
	`24`	`+ * 4`
	`25`	`+ * / \`
	`26`	`+ * 2 6`
	`27`	`+ * / / \`
	`28`	`+ * 1 5 7`
	`29`	`+ * </pre>`
	`30`	`+ */`
`21`	`31`	`private fun getBinarySearchTree(): BinarySearchTree {`
`22`	`32`	`val binarySearchTree = BinarySearchTree()`
`23`	`33`
`24`	`34`	`binarySearchTree.insert(4)`
`25`	`35`	`binarySearchTree.insert(2)`
	`36`	`+ binarySearchTree.insert(1)`
	`37`	`+ binarySearchTree.insert(6)`
	`38`	`+ binarySearchTree.insert(5)`
`26`	`39`	`binarySearchTree.insert(7)`
`27`	`40`
`28`	`41`	`return binarySearchTree`

Lines changed: 7 additions & 7 deletions

Original file line number	Diff line number	Diff line change
`@@ -16,13 +16,13 @@ object Runner {`
`16`	`16`	`/**`
`17`	`17`	`* It returns BST like this:`
`18`	`18`	`* <pre>`
`19`		`- * 4`
`20`		`- * / \`
`21`		`- * 2 7`
`22`		`- * / / \`
`23`		`- * 1 6 20`
`24`		`- * \`
`25`		`- * 23`
	`19`	`+ * 4`
	`20`	`+ * / \`
	`21`	`+ * 2 7`
	`22`	`+ * / / \`
	`23`	`+ * 1 6 20`
	`24`	`+ * \`
	`25`	`+ * 23`
`26`	`26`	`* </pre>`
`27`	`27`	`*/`
`28`	`28`	`private fun getBinarySearchTree(): BinarySearchTree {`

Comments

(0)