// coding · modul 14O'rta10 mavzu · ~8 soat

Daraxtlar

Binary tree, BST, heap, trie, DSU — tree ma'lumot tuzilmalari.

0/10 · 0%

Bu modul — Premium

Darslarni ochish uchun Premium obuna kerak. Dastlabki 3 ta modul bepul.

Darslar

10 ta dars

1Tree yakuniy masalalarHOZIR+10

2Tree tushunchasi — root, leaf, depth, height+10

3Binary Tree Traversal — preorder, inorder, postorder+10

4Level Order Traversal (BFS on Tree)+10

5Binary Tree masalalari+10

6Binary Search Tree (BST)+10

7BST masalalari+10

8Heap va Heap Sort+10

9Trie (Prefix Tree)+10

10DSU (Disjoint Set Union) — Union-Find+10