Commit b3bccf3

committed

rename bst

1 parent c338ac0 commit b3bccf3Copy full SHA for b3bccf3

File tree

+18

-29

lines changed

+18

-29

lines changed

Lines changed: 8 additions & 10 deletions

Original file line number	Diff line number	Diff line change
`@@ -77,7 +77,7 @@ include::chapters/non-linear-data-structures-intro.adoc[]`
`77`	`77`	`include::chapters/tree.adoc[]`
`78`	`78`
`79`	`79`	`// (g)`
`80`		`-include::chapters/binary-search-tree.adoc[]`
	`80`	`+include::chapters/tree--binary-search-tree.adoc[]`
`81`	`81`
`82`	`82`	`// (g)`
`83`	`83`	`// include::chapters/map.adoc[]`
`@@ -102,6 +102,9 @@ include::chapters/set.adoc[]`
`102`	`102`	`// (g)`
`103`	`103`	`include::chapters/graph.adoc[]`
`104`	`104`
	`105`	`+// TODO: pending`
	`106`	`+include::chapters/graph-search.adoc[]`
	`107`	`+`
`105`	`108`	`:leveloffset: -1`
`106`	`109`
`107`	`110`	`= Algorithms`
`@@ -111,33 +114,28 @@ include::chapters/algorithms-intro.adoc[]`
`111`	`114`
`112`	`115`	`:leveloffset: +1`
`113`	`116`
	`117`	`+//`
	`118`	`+// Sorting algorithms`
	`119`	`+//`
	`120`	`+`
`114`	`121`	`// TODO: pending`
`115`	`122`	`include::chapters/sorting-intro.adoc[]`
`116`	`123`
`117`		`-//`
`118`	`124`	`// Slow Sorting`
`119`		`-//`
`120`	`125`
`121`	`126`	`include::chapters/insertion-sort.adoc[]`
`122`	`127`
`123`	`128`	`include::chapters/selection-sort.adoc[]`
`124`	`129`
`125`	`130`	`include::chapters/bubble-sort.adoc[]`
`126`	`131`
`127`		`-//`
`128`	`132`	`// Fast Sorting`
`129`		`-//`
`130`	`133`
`131`	`134`	`include::chapters/merge-sort.adoc[]`
`132`	`135`
`133`	`136`	`include::chapters/quick-sort.adoc[]`
`134`	`137`
`135`		`-//`
`136`		`-// Searching`
`137`		`-//`
`138`	`138`
`139`		`-// TODO: pending`
`140`		`-include::chapters/graph-search.adoc[]`
`141`	`139`
`142`	`140`	`:leveloffset: -1`
`143`	`141`

File renamed without changes.

Lines changed: 10 additions & 0 deletions

Original file line number	Diff line number	Diff line change
`@@ -56,6 +56,14 @@ The binary restricts the nodes to have at most two children. Trees, in general,`
`56`	`56`	`.Binary tree has at most 2 children while non-binary trees can have more.`
`57`	`57`	`image:image32.png[image,width=321,height=193]`
`58`	`58`
	`59`	`+Binary trees are the one of the most common types and it's used to build other data structures and applications.`
	`60`	`+`
	`61`	`+.Binary Tree Applications`
	`62`	`+- <<Map>>`
	`63`	`+- <<Set>>`
	`64`	`+- Priority Queues`
	`65`	`+- <<Binary Search Tree (BST)>>`
	`66`	`+`
`59`	`67`
`60`	`68`	`=== Binary Search Tree (BST)`
`61`	`69`
`@@ -73,6 +81,8 @@ The heap (max-heap) is a type of binary tree where the children's values are hig`
`73`	`81`
`74`	`82`	`.Heap vs BST`
`75`	`83`	`image:image34.png[image,width=325,height=176]`
	`84`	`+`
	`85`	`+`
`76`	`86`	`The (max) heap has the maximum value in the root, while BST doesn’t.`
`77`	`87`
`78`	`88`	`There is two kind of heaps: min-heap and max-heap.`

Lines changed: 0 additions & 19 deletions

Original file line number	Diff line number	Diff line change
`@@ -5,25 +5,6 @@`
`5`	`5`	`- [ ] More algorithm and datastructres! Greedy, Divide and Conquer etc.`
`6`	`6`	`- [ ] Algorithms visualizations like https://bost.ocks.org/mike/algorithms/`
`7`	`7`
`8`		`-## Algorithms`
`9`		`-1. Searching algorithms (WIP)`
`10`		`-2. Sorting algorithms (WIP)`
`11`		`-`
`12`		`-Compare content with:`
`13`		`-- [ ] https://adrianmejia.com/blog/2018/04/28/data-structures-time-complexity-for-beginners-arrays-hashmaps-linked-lists-stacks-queues-tutorial/#Stacks`
`14`		`-- [ ] https://medium.freecodecamp.org/time-is-complex-but-priceless-f0abd015063c`
`15`		`-- [ ] https://leetcode.com/explore/learn/`
`16`		`-- [ ] https://github.com/trekhleb/javascript-algorithms`
`17`		`-- [ ] https://www.khanacademy.org/computing/computer-science/algorithms`
`18`		`-- [ ] Compare with: Data Structures and Algorithms.pdf by Lydia Hallie`
`19`		`-- [ ] Cracking code interviews`
`20`		`-- [ ] Grokking Algorithms`
`21`		`-- [ ] CS Distilled`
`22`		`-- [ ] Create poster like: http://bigocheatsheet.com/, http://bigoref.com/,`
`23`		`-- [ ] https://introcs.cs.princeton.edu/java/11cheatsheet/`
`24`		`-`
`25`		`-`
`26`		`-`
`27`	`8`	`# Troubleshooting`
`28`	`9`	`Some notes while working on this project`
`29`	`10`

Comments

(0)