DSA.UZ
Buy me a coffeeBuy me a coffee (opens in a new tab)Savollar ✉️Savollar ✉️ (opens in a new tab)
  • Kirish
  • Big O notation
  • Ma'lumotlar Strukturasi
    • 1. Arrays
    • 2. Linked List
    • 3. Stack
    • 4. Queue
    • 5. Graph
    • 6. Tree
    • 7. Trie
    • 8. Heap
    • 9. Hash Table
  • Algoritmlar
    • 1. Algorithmic Paradigms
    • 2. Sorting
    • 3. Searching
    • 4. Graph Algorithms
    • 5. Greedy Algorithms
    • 6. Dynamic Porgamming
    • 7. Divide and Conquer
  • Biz haqimizda!
  • Kirish
  • Big O notation
  • Ma'lumotlar Strukturasi
    • 1. Arrays
    • 2. Linked List
    • 3. Stack
    • 4. Queue
    • 5. Graph
    • 6. Tree
      • Tree
    • 7. Trie
    • 8. Heap
    • 9. Hash Table
  • Algoritmlar
    • 1. Algorithmic Paradigms
    • 2. Sorting
    • 3. Searching
    • 4. Graph Algorithms
    • 5. Greedy Algorithms
    • 6. Dynamic Porgamming
    • 7. Divide and Conquer
  • Biz haqimizda!
    • Java
    • Python
    • JavaScript
    • C++
    • Go
    • Rust
    • Swift
    • C
  • Buy me a coffee (opens in a new tab)
  • Savollar ✉️ (opens in a new tab)

On This Page

  • Tree
Feedback (opens in a new tab)
Ma'lumotlar Strukturasi
6. Tree

Tree

Tez orada

5. Graph7. Trie
© 2023 | dsa.uz