rename bst

Author: amejiarosario

book/book.adoc

@@ -77,7 +77,7 @@ include::chapters/non-linear-data-structures-intro.adoc[]
 include::chapters/tree.adoc[]
 
 // (g)
-include::chapters/binary-search-tree.adoc[]
+include::chapters/tree--binary-search-tree.adoc[]
 
 // (g)
 // include::chapters/map.adoc[]
@@ -102,6 +102,9 @@ include::chapters/set.adoc[]
 // (g)
 include::chapters/graph.adoc[]
 
+// TODO: pending
+include::chapters/graph-search.adoc[]
+
 :leveloffset: -1
 
 = Algorithms
@@ -111,33 +114,28 @@ include::chapters/algorithms-intro.adoc[]
 
 :leveloffset: +1
 
+//
+// Sorting algorithms
+//
+
 // TODO: pending
 include::chapters/sorting-intro.adoc[]
 
-//
 // Slow Sorting
-//
 
 include::chapters/insertion-sort.adoc[]
 
 include::chapters/selection-sort.adoc[]
 
 include::chapters/bubble-sort.adoc[]
 
-//
 // Fast Sorting
-//
 
 include::chapters/merge-sort.adoc[]
 
 include::chapters/quick-sort.adoc[]
 
-//
-// Searching
-//
 
-// TODO: pending
-include::chapters/graph-search.adoc[]
 
 :leveloffset: -1
 

book/chapters/binary-search-tree.adoc renamed to book/chapters/tree--binary-search-tree.adoc

@@ -56,6 +56,14 @@ The binary restricts the nodes to have at most two children. Trees, in general,
 .Binary tree has at most 2 children while non-binary trees can have more.
 image:image32.png[image,width=321,height=193]
 
+Binary trees are the one of the most common types and it's used to build other data structures and applications.
+
+.Binary Tree Applications
+- <<Map>>
+- <<Set>>
+- Priority Queues
+- <<Binary Search Tree (BST)>>
+
 
 === Binary Search Tree (BST)
 
@@ -73,6 +81,8 @@ The heap (max-heap) is a type of binary tree where the children's values are hig
 
 .Heap vs BST
 image:image34.png[image,width=325,height=176]
+
+
 The (max) heap has the maximum value in the root, while BST doesn’t.
 
 There is two kind of heaps: min-heap and max-heap.

book/chapters/tree.adoc

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