Commit 758cb42

committed

tree traversal

1 parent f40834f commit 758cb42Copy full SHA for 758cb42

File tree

-1

lines changed

-1

lines changed

Lines changed: 2 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -76,11 +76,12 @@ include::chapters/non-linear-data-structures-intro.adoc[]`
`76`	`76`	`// (g)`
`77`	`77`	`include::chapters/tree.adoc[]`
`78`	`78`
`79`		`-include::chapters/tree--binary-tree-traversal.adoc[]`
`80`	`79`
`81`	`80`	`// (g)`
`82`	`81`	`include::chapters/tree--binary-search-tree.adoc[]`
`83`	`82`
	`83`	`+include::chapters/tree--binary-tree-traversal.adoc[]`
	`84`	`+`
`84`	`85`	`include::chapters/tree--self-balancing-rotations.adoc[]`
`85`	`86`
`86`	`87`	`:leveloffset: +1`

Lines changed: 6 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -201,6 +201,7 @@ class BinarySearchTree {`
`201`	`201`	`}`
`202`	`202`	`}`
`203`	`203`
	`204`	`+ // tag::inOrderTraversal[]`
`204`	`205`	`/**`
`205`	`206`	`* In-order traversal on a tree: left-root-right.`
`206`	`207`	`*`
`@@ -213,7 +214,9 @@ class BinarySearchTree {`
`213`	`214`	`yield node;`
`214`	`215`	`if (node && node.right) { yield* this.inOrderTraversal(node.right); }`
`215`	`216`	`}`
	`217`	`+ // end::inOrderTraversal[]`
`216`	`218`
	`219`	`+ // tag::preOrderTraversal[]`
`217`	`220`	`/**`
`218`	`221`	`* Pre-order traversal on a tree: root-left-right.`
`219`	`222`	`* Similar results to DFS`
`@@ -226,7 +229,9 @@ class BinarySearchTree {`
`226`	`229`	`if (node.left) { yield* this.preOrderTraversal(node.left); }`
`227`	`230`	`if (node.right) { yield* this.preOrderTraversal(node.right); }`
`228`	`231`	`}`
	`232`	`+ // end::preOrderTraversal[]`
`229`	`233`
	`234`	`+ // tag::postOrderTraversal[]`
`230`	`235`	`/**`
`231`	`236`	`* Post-order traversal on a tree: left-right-root.`
`232`	`237`	`*`
`@@ -237,6 +242,7 @@ class BinarySearchTree {`
`237`	`242`	`if (node.right) { yield* this.postOrderTraversal(node.right); }`
`238`	`243`	`yield node;`
`239`	`244`	`}`
	`245`	`+ // end::postOrderTraversal[]`
`240`	`246`
`241`	`247`	`/**`
`242`	`248`	`* Represent Binary Tree as an array.`

Comments

(0)