@@ -22,6 +22,10 @@ include::chapters/preface.adoc[]
2222// chapters
2323//
2424
25+ = Algorithms Analysis
26+
27+ include::chapters/algorithms-analysis-intro.adoc[]
28+
2529:leveloffset: +1
2630
2731include::chapters/algorithms-analysis.adoc[]
@@ -30,6 +34,72 @@ include::chapters/big-o-examples.adoc[]
3034
3135:leveloffset: -1
3236
37+ = Linear Data Structures
38+
39+ include::chapters/linear-data-structures-intro.adoc[]
40+
41+ :leveloffset: +1
42+
43+ include::chapters/array.adoc[]
44+
45+ include::chapters/linked-list.adoc[]
46+
47+ include::chapters/stack.adoc[]
48+
49+ include::chapters/queue.adoc[]
50+
51+ :leveloffset: -1
52+
53+ = Non-Linear Data Structures
54+
55+ include::chapters/non-linear-data-structures-intro.adoc[]
56+
57+ :leveloffset: +1
58+
59+ include::chapters/graph.adoc[]
60+
61+ include::chapters/tree.adoc[]
62+
63+ include::chapters/binary-search-tree.adoc[]
64+
65+ include::chapters/avl-tree.adoc[]
66+
67+ include::chapters/red-black-tree.adoc[]
68+
69+ include::chapters/heap.adoc[]
70+
71+ include::chapters/trie.adoc[]
72+
73+ include::chapters/map.adoc[]
74+
75+ include::chapters/set.adoc[]
76+
77+ :leveloffset: -1
78+
79+ = Algorithms
80+
81+ include::chapters/algorithms-intro.adoc[]
82+
83+ :leveloffset: +1
84+
85+ // Slow Sorting
86+
87+ include::chapters/selection-sort.adoc[]
88+
89+ include::chapters/insertion-sort.adoc[]
90+
91+ include::chapters/bubble-sort.adoc[]
92+
93+ // Fast Sorting
94+
95+ include::chapters/merge-sort.adoc[]
96+
97+ include::chapters/quick-sort.adoc[]
98+
99+ include::chapters/tim-sort.adoc[]
100+
101+ :leveloffset: -1
102+
33103//
34104// end chapters
35105//
0 commit comments