Skip to content

Commit 1fced28

Browse files
authoredOct 30, 2020
Merge pull request amejiarosario#94 from amejiarosario/feat/set-improvements
Feat/set improvements

Some content is hidden

Large Commits have some content hidden by default. Use the searchbox below for content that may be hidden.

49 files changed

+725
-612
lines changed
 

‎README.md

Lines changed: 2 additions & 2 deletions
Original file line numberDiff line numberDiff line change
@@ -271,8 +271,8 @@ Use Linked Lists when:
271271
#### [HashMaps](book/content/part03/map.asc)
272272

273273
Learn how to implement different types of Maps such as:
274-
- [HashMap](book/content/part03/hashmap.asc)
275-
- [TreeMap](book/content/part03/treemap.asc)
274+
- [HashMap](book/content/part02/hash-map.asc)
275+
- [TreeMap](book/content/part03/tree-map.asc)
276276

277277
Also, [learn the difference between the different Maps implementations](book/content/part03/time-complexity-graph-data-structures.asc):
278278

‎book/B-self-balancing-binary-search-trees.asc

Lines changed: 2 additions & 3 deletions
Original file line numberDiff line numberDiff line change
@@ -36,8 +36,8 @@ Let's go one by one.
3636

3737
Right rotation moves a node on the right as a child of another node.
3838

39-
Take a look at the `@example` in the code below.
40-
As you can see we have an unbalanced tree `4-3-2-1`.
39+
Take a look at the examples in the code in the next section.
40+
As you will see we have an unbalanced tree `4-3-2-1`.
4141
We want to balance the tree, for that we need to do a right rotation of node 3.
4242
So, we move node 3 as the right child of the previous child.
4343

@@ -140,4 +140,3 @@ This rotation is also referred to as `RL rotation`.
140140
=== Self-balancing trees implementations
141141

142142
So far, we have study how to make tree rotations which are the basis for self-balancing trees. There are different implementations of self-balancing trees such a Red-Black Tree and AVL Tree.
143-

0 commit comments

Comments
 (0)
Please sign in to comment.