Cohorts
  • Discover
  • About Us
  • Blog
  • Patika.dev
  • Web3

Veri Yapıları ve Algoritmalar

Algoritma Nedir?
Bilgilerin Bilgisayarda İfadesi
Sayı Sistemleri
Sayısal Olmayan Verilerin Tutulması
Verilerin Tutulması
Recursion

Array
Linked List
Linked List vs Array
Linked List Eleman Ekleme/Silme
Stack
Queue
Hash Table
Hash Function
Hash Collision

Algoritma Analizi Giriş
RAM Modeli
Time Complexity
Big O Notation

Sorting Nedir?
Selection Sort
Merge Sort
Quick Sort

Searching Nedir?
Linear Search
Binary Search
Binary Search Tree

Insertion Sort Projesi
Merge Sort Projesi
Binary Search Tree Projesi

Proje 3

[7, 5, 1, 8, 3, 6, 0, 9, 4, 2] dizisinin Binary-Search-Tree aşamalarını yazınız.

Örnek: root x'dir. root'un sağından y bulunur. Solunda z bulunur vb.

Proje Zamanı!

Submit your work to complete this lesson.

Join the project workspace to share your solution and receive feedback.

Previous

Lesson discussion

Swap insights and ask questions about “Veri Yapıları ve Algoritmalar”.

Enroll to participate
Start the course to unlock the discussion. Enrolling helps us keep conversations relevant to learners.
Cohorts
WebsiteDiscoverBlogPatika.devRise In
CoursesCircleRustSoliditySolanaWeb3 FundamentalsBlockchain Basics
CompanyAbout UsTerms of UsePrivacy PolicyGDPR NoticeCookies
Don't miss any update!

Disclaimer: The information, programs, and events provided on https://cohorts.patika.dev is strictly for upskilling and networking purposes related to the technical infrastructure of blockchain platforms. We do not provide financial or investment advice, nor do we make any representations regarding the value, profitability, or future price of any blockchain or cryptocurrency. Users are encouraged to conduct their own research and consult with licensed financial professionals before engaging in any investment activities. https://cohorts.patika.dev disclaims any responsibility for financial decisions made by users based on the information provided here.

© 2026 Cohorts, All rights reserved