Commit 6b9a4e8

committed

fix(bst): some typos on the code

1 parent 3c32d0e commit 6b9a4e8Copy full SHA for 6b9a4e8

File tree

-7

lines changed

-7

lines changed

Lines changed: 4 additions & 4 deletions

Original file line number	Diff line number	Diff line change
`@@ -249,14 +249,14 @@ class BinarySearchTree {`
`249`	`249`	`/**`
`250`	`250`	`* Represent Binary Tree as an array.`
`251`	`251`	`*`
`252`		- * Leaf nodes will have two `undefined` descendents.
	`252`	+ * Leaf nodes will have two `undefined` descendants.
`253`	`253`	`*`
`254`	`254`	`* The array representation of the binary tree is as follows:`
`255`	`255`	`*`
`256`	`256`	`* First element (index=0) is the root.`
`257`		`- * The following two elements (index=1,2) are descendents of the root: left (a) and right (b).`
`258`		`- * The next two elements (index=3,4) are the descendents of a`
`259`		`- * The next two elements (index=5,6) are the descendents of b and so on.`
	`257`	`+ * The following two elements (index=1,2) are descendants of the root: left (a) and right (b).`
	`258`	`+ * The next two elements (index=3,4) are the descendants of a`
	`259`	`+ * The next two elements (index=5,6) are the descendants of b and so on.`
`260`	`260`	`*`
`261`	`261`	`* 0 1 2 3 4 5 6 n`
`262`	`262`	`* [root, a=root.left, b=root.right, a.left, a.right, b.left, b.right, ...]`

Lines changed: 3 additions & 3 deletions

Original file line number	Diff line number	Diff line change
`@@ -19,7 +19,7 @@ class BinaryTreeNode {`
`19`	`19`
`20`	`20`	`// tag::setAndUpdateParent[]`
`21`	`21`	`/**`
`22`		`- * Set a left node descendents.`
	`22`	`+ * Set a left node descendants.`
`23`	`23`	`* Also, children get associated to parent.`
`24`	`24`	`*/`
`25`	`25`	`setLeftAndUpdateParent(node) {`
`@@ -31,7 +31,7 @@ class BinaryTreeNode {`
`31`	`31`	`}`
`32`	`32`
`33`	`33`	`/**`
`34`		`- * Set a right node descendents.`
	`34`	`+ * Set a right node descendants.`
`35`	`35`	`* Also, children get associated to parent.`
`36`	`36`	`*/`
`37`	`37`	`setRightAndUpdateParent(node) {`
`@@ -71,7 +71,7 @@ class BinaryTreeNode {`
`71`	`71`	`}`
`72`	`72`
`73`	`73`	`/**`
`74`		`- * Node is leaf is it has no descendents`
	`74`	`+ * Node is leaf is it has no descendants`
`75`	`75`	`*/`
`76`	`76`	`get isLeaf() {`
`77`	`77`	`return !this.left && !this.right;`

Comments

(0)