Commit bb3ad9a

authored

Merge pull request amejiarosario#40 from amejiarosario/version-bump

bump to 1.3.8

2 parents b9a41ba + a53915f commit bb3ad9aCopy full SHA for bb3ad9a

File tree

+13

-3

lines changed

+13

-3

lines changed

Lines changed: 11 additions & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -13,6 +13,15 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0`
`13`	`13`
`14`	`14`	`### Bug Fixes (patch)`
`15`	`15`
	`16`	`+## [1.3.8]`
	`17`	`+`
	`18`	`+### Breaking Changes (major)`
	`19`	`+`
	`20`	`+### New Features (minor)`
	`21`	`+`
	`22`	`+### Bug Fixes (patch)`
	`23`	`+- fix(book): fix typo, array pop, and BST images [commit](https://github.com/amejiarosario/dsa.js/commit/ac9858348943f9678d116c8076bfa3a3c5362741)`
	`24`	`+`
`16`	`25`	`## [1.3.7]`
`17`	`26`
`18`	`27`	`### Breaking Changes (major)`
`@@ -125,7 +134,8 @@ and this project adheres to [Semantic Versioning](https://semver.org/spec/v2.0.0`
`125`	`134`
`126`	`135`	`-`
`127`	`136`
`128`		`-[Unreleased]: https://github.com/amejiarosario/dsa.js/compare/1.3.7...HEAD`
	`137`	`+[Unreleased]: https://github.com/amejiarosario/dsa.js/compare/1.3.8...HEAD`
	`138`	`+[1.3.7]: https://github.com/amejiarosario/dsa.js/compare/1.3.7...1.3.8`
`129`	`139`	`[1.3.6]: https://github.com/amejiarosario/dsa.js/compare/1.3.6...1.3.7`
`130`	`140`	`[1.3.6]: https://github.com/amejiarosario/dsa.js/compare/1.3.5...1.3.6`
`131`	`141`	`[1.3.5]: https://github.com/amejiarosario/dsa.js/compare/1.3.4...1.3.5`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -90,7 +90,7 @@ image::image33.png[image,width=348,height=189]`
`90`	`90`	`(((Max-Heap)))`
`91`	`91`	`(((Min-Heap)))`
`92`	`92`	`(((Data Structures, Non-Linear, Binary Heap)))`
`93`		`-The heap (max-heap) is a type of binary tree where the children's values are higher than the parent. Opposed to the BST, the left child doesn’t have to be smaller than the right child.`
	`93`	`+The heap (max-heap) is a type of binary tree where the parent's value is higher than the value of both children. Opposed to the BST, the left child doesn’t have to be smaller than the right child.`
`94`	`94`
`95`	`95`	`.Heap vs BST`
`96`	`96`	`image::image34.png[image,width=325,height=176]`

Lines changed: 1 addition & 1 deletion

Original file line number	Diff line number	Diff line change
`@@ -1,6 +1,6 @@`
`1`	`1`	`{`
`2`	`2`	`"name": "dsa.js",`
`3`		`- "version": "1.3.7",`
	`3`	`+ "version": "1.3.8",`
`4`	`4`	`"description": "Data Structures & Algorithms in JS",`
`5`	`5`	`"author": "Adrian Mejia <hi+dsajs@adrianmejia.com> (https://adrianmejia.com)",`
`6`	`6`	`"homepage": "https://github.com/amejiarosario/dsa.js",`

Comments

(0)