@@ -61,7 +61,7 @@ Comparison between full binary tree and complete binary tree
![Complete binary tree creation](img/102b22745befe498a273190379c7b4ce.png "Put the second element as a left child of the root node and the third element as the right child")
12 个是左侧孩子,9 个是右侧孩子
12 个是左侧子级,9 个是右侧子级
...
...
@@ -70,7 +70,7 @@ Comparison between full binary tree and complete binary tree
![Complete binary tree creation](img/846541cb9b5dcce8a8f11e736bb6c9f3.png "Keep repeating until the last element is reached")
![graph data structure explained using facebook's example. Users, groups, pages, events, etc. are represented as nodes and their relationships - friend, joining a group, liking a page are represented as links between nodes](img/85cd94ece58965f7646c95b7496418ba.png"Example of graph data structure")
...
...
@@ -16,12 +16,12 @@ Example of graph data structure