Skip to content

Commit 53be873

Browse files
initial commit
1 parent 27f1e36 commit 53be873

1 file changed

Lines changed: 6 additions & 6 deletions

File tree

‎Algorithm/Sorting algorithm/heap-sort/concept.md‎

Lines changed: 6 additions & 6 deletions
Original file line numberDiff line numberDiff line change
@@ -152,12 +152,12 @@ First, we need to build a max heap from the array. A max heap is a binary tree w
152152

153153
At this point, we have built a max heap: `[82, 27, 43, 3, 9, 38, 10]`.
154154

155-
82
156-
/ \
157-
43 38
158-
/ \ / \
159-
27 3 9 10
160-
*Max Heap Representation*
155+
82
156+
/ \
157+
43 38
158+
/ \ / \
159+
27 3 9 10
160+
*Initial Max Heap Represented on a Binary Tree*
161161

162162
### Step 2: Extract Elements from the Heap
163163

0 commit comments

Comments
 (0)