<ul>
<li><p><strong>Linked Lists</strong> - bu ketma-ketligi xotiradagi joylashuviga bog'liq bo'lmagan <code>chiziqli</code> ma'lumotlar <code>to'plami</code>.</p>
</li>
<li><p>Ro'yhatning har-bir elementi keyingi elementga <code>ishora</code> qiladi.</p>
</li>
<li><p>Ma'lumotlar tuzilmasi sifatida LinkeListni bir-biriga <code>bog'langan tugunlar</code> ko'rinishida tasavvur qilamiz.</p>
</li>
<li><p>Har bir tugun o'z <code>qiymatini</code> va keyingi element <code>manzilini</code> saqlaydi.</p>
</li>
</ul>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077287187/kAf_VeRn-.png" alt="Image description" />
<code>oxirgi element null</code></p>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077289264/LJbZEY3p4.png" alt="Image description" /></p>
<ul>
<li>Arrayning - har-bir elementi xotirada ketma ket joylashgan bo'lishi kerak.</li>
<li>LinkedList - hohlagan bo'sh joyda joylashaveradi , har bir element o'zidan keyingi elementning manzilini saqalaydi.</li>
</ul>
<blockquote>
<p>Linked Listda biz 4- yoki 5- elementni o'qish uchun biz birinchi elementdat boshlab o'qib chiqishimiz kerak , chunki 4- elementning manzili 3- elementda , 3- niki esa 2- da va hokazo ...</p>
</blockquote>
<div class="hn-table">
<table>
<thead>
<tr>
<td></td><td>Array</td><td>Linked List</td></tr>
</thead>
<tbody>
<tr>
<td>O'qish</td><td>O(1)</td><td>O(n)</td></tr>
<tr>
<td>Qo'shish</td><td>O(n)</td><td>O(1)</td></tr>
<tr>
<td>O'chirish</td><td>O(n)</td><td>O(1)</td></tr>
</tbody>
</table>
</div><p><strong>Arrays vs Linked Lists</strong></p>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077291596/T-aBjIaM-.png" alt="Image description" /></p>
<p><strong>Linked Lists turlari</strong></p>
<p>Singly Linked Lists - Bir Tomonlama Ro'yhat</p>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077293879/vAcKfLd6r.png" alt="Image description" />
Circular Linked Lists - Aylana Ro'yxat</p>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077295732/Gr3TVOpie.png" alt="Image description" />
Doubly Linked Lists - Ikki Tomonlama Ro'yhat</p>
<p><img src="https://cdn.hashnode.com/res/hashnode/image/upload/v1655077297838/vrv1su50g.png" alt="Image description" /></p>
<p>C# da Linked List dan qanday foydalanish haqida keyingi postda yoritaman.</p>


- **Linked Lists** - bu ketma-ketligi xotiradagi joylashuviga bog'liq bo'lmagan `chiziqli` ma'lumotlar `to'plami`.

- Ro'yhatning har-bir elementi keyingi elementga `ishora` qiladi.

- Ma'lumotlar tuzilmasi sifatida LinkeListni bir-biriga `bog'langan tugunlar` ko'rinishida tasavvur qilamiz.

- Har bir tugun o'z `qiymatini` va keyingi element `manzilini` saqlaydi.


![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077287187/kAf_VeRn-.png)
`oxirgi element null`

![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077289264/LJbZEY3p4.png)

- Arrayning - har-bir elementi xotirada ketma ket joylashgan bo'lishi kerak.
- LinkedList - hohlagan bo'sh joyda joylashaveradi , har bir element o'zidan keyingi elementning manzilini saqalaydi.

> Linked Listda biz 4- yoki 5- elementni o'qish uchun biz birinchi elementdat boshlab o'qib chiqishimiz kerak , chunki 4- elementning manzili 3- elementda , 3- niki esa 2- da va hokazo ...



|       | Array | Linked List     |
| :---        |    :----:   |          ---: |
| O'qish      |  O(1)       |    O(n)   |
| Qo'shish   |   O(n)        |    O(1)      |
| O'chirish   |  O(n)        |   O(1)      |

**Arrays vs Linked Lists**


![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077291596/T-aBjIaM-.png)

**Linked Lists turlari**

Singly Linked Lists - Bir Tomonlama Ro'yhat

![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077293879/vAcKfLd6r.png)
Circular Linked Lists - Aylana Ro'yxat

![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077295732/Gr3TVOpie.png)
Doubly Linked Lists - Ikki Tomonlama Ro'yhat

![Image description](https://cdn.hashnode.com/res/hashnode/image/upload/v1655077297838/vrv1su50g.png)

C# da Linked List dan qanday foydalanish haqida keyingi postda yoritaman.

Xakimov's

Xakimov's

Linked List

	Array	Linked List
O'qish	O(1)	O(n)
Qo'shish	O(n)	O(1)
O'chirish	O(n)	O(1)