Commit 436848d

committed

fixes format

1 parent 1d75301 commit 436848dCopy full SHA for 436848d

File tree

-7

lines changed

-7

lines changed

Lines changed: 6 additions & 6 deletions

Original file line number	Diff line number	Diff line change
@@ -52,12 +52,12 @@ With the methods `add` and `remove`, we have to guarantee that our tree always h
`52`	`52`	`===== Inserting new elements in a BST`
`53`	`53`
`54`	`54`	`.For inserting an element in a BST, we have two scenarios:`
`55`		`-1. If the tree is empty (root element is null), we add the newly created node as root, and that's it!`
`56`		`-2. If the tree has a root, compare the new value with the root. Then we have three possibilities:`
`57`		-2.1. `root == newValue`: we increase the duplicity counter in that case, and done!
`58`		-2.2 `root > newValue`, we search on the left side of the root.
`59`		-2.3 `root < newValue`, we search on the right side of the root.
`60`		-3. Repeat the comparison between the current node and `newValue`, until we find the value or (null) space.
	`55`	`+. If the tree is empty (root element is null), we add the newly created node as root, and that's it!`
	`56`	`+. If the tree has a root, compare the new value with the root. Then we have three possibilities:`
	`57`	+.. `root == newValue`: we increase the duplicity counter in that case, and done!
	`58`	+.. `root > newValue`, we search on the left side of the root.
	`59`	+.. `root < newValue`, we search on the right side of the root.
	`60`	+. Repeat the comparison between the current node and `newValue`, until we find the value or (null) space.
`61`	`61`
`62`	`62`	`For instance, let’s say that we want to insert the values 19, 21, 10, 2, 18 in a BST:`
`63`	`63`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -297,7 +297,7 @@ include::{codedir}/data-structures/graphs/node.js[tag=removeAdjacent, indent=0]`
`297`	`297`	`.2+.^s\| Data Structure 2+^s\| Vertices 2+^s\| Edges .2+^.^s\| Space Complexity`
`298`	`298`	`^\|_Add_ ^\|_Remove_ ^\|_Add_ ^\|_Remove_`
`299`	`299`	`\| Graph (adj. matrix) ^\| O(\\|V\\|^2^) ^\| O(\\|V\\|^2^) ^\|O(1) ^\|O(1) ^\|O(\\|V\\|^2^)`
`300`		`-\| Graph (adj. list w/array) ^\| O(1) ^\| O(\\|V\\| + \\|E\\|)) ^\|O(1) ^\|O(\\|V\\| + \\|E\\|) ^\|O(\\|V\\| + \\|E\\|)`
	`300`	`+\| Graph (adj. list w/array) ^\| O(1) ^\| O(\\|V\\| + \\|E\\|)) ^\|O(1) ^\|O(\\|E\\|) ^\|O(\\|V\\| + \\|E\\|)`
`301`	`301`	`\| Graph (adj. list w/HashSet) ^\| O(1) ^\| O(\\|V\\|)) ^\|O(1) ^\|O(1) ^\|O(\\|V\\| + \\|E\\|)`
`302`	`302`	`\|===`
`303`	`303`	`// end::table[]`

Comments

(0)