Tree, Binary Tree (B Tree) and Binary Search Tree in Sinhala Part 01 || DSA

This video is created for Educational Purposes only. Re-usage of content or the video is strictly prohibited. All these videos are property of "Deshan K Sumanathilaka" Youtube Channel. In any need of reusing the content please contact [email protected]. Videos By: Deshan K Sumanathilaka (BTech Computer Science & Engineering, MCS(Reading) ) Assistant Lecturer, IIT Editing: Camtasia 2019 C programming:    • C programming [Introduction] Video 1 || In...   Python in English:    • Introduction to python - How to install an...   python is sinhala:   • Python Introduction in Sinhala ||  AL ICT ...   Operating Systems:    • Shortest Job First (SJF) - Burst Time [ 5 ...   Number Systems:   • Number Systems Introduction Sinhala || Dec...   Logic gates:   • AND OR NOT Gates in Sinhala || Logic Gates...   Sorting Algorithms:   • Sorting algorithms Introduction and Time C...   Database and SQL:   • AL ICT - Database in Sinhala   PHP:    • AL ICT - PHP Sinhala  

Join Today
Inorder Preorder and Postorder (infix prefix postfix) Traversal in a BST|| Binary Search Tree || DSA
▶︎

Inorder Preorder and Postorder (infix prefix postfix) Traversal in a BST|| Binary Search Tree || DSA

Binary Search Tree Node Deletion Explained in Sinhala || Data Structures and Algorithm || UG CS SE
▶︎

Binary Search Tree Node Deletion Explained in Sinhala || Data Structures and Algorithm || UG CS SE

5.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials
▶︎

5.2 Binary Tree in Data Structure| Types of Binary Tree| Data Structures Tutorials

5.10 Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course
▶︎

5.10 Binary Search Trees (BST) - Insertion and Deletion | DSA Full Course

Hashing functions ගැන සරලව - Data Security Part 1 - Hashing Functions [Sinhala]
▶︎

Hashing functions ගැන සරලව - Data Security Part 1 - Hashing Functions [Sinhala]

AVL tree | Self balancing binary tree | Sinhala
▶︎

AVL tree | Self balancing binary tree | Sinhala

Tree Data Structure | Binary Tree | Sinhala
▶︎

Tree Data Structure | Binary Tree | Sinhala

Linked List Explained In sinhala || Data Structures and algorithms || Undergraduate CS SE IT
▶︎

Linked List Explained In sinhala || Data Structures and algorithms || Undergraduate CS SE IT

Tree Traversal | Pre Order traversal | In Order traversal | Post Order traversal | Sinhala
▶︎

Tree Traversal | Pre Order traversal | In Order traversal | Post Order traversal | Sinhala

Big (O) in Sinhala | Big (O) සිංහලෙන්
▶︎

Big (O) in Sinhala | Big (O) සිංහලෙන්

If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes
▶︎

If You Have A Bad Memory, I’ll Help You Fix It In 28 Minutes

6.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures
▶︎

6.2 BFS and DFS Graph Traversals| Breadth First Search and Depth First Search | Data structures

SJF Preemptive (SRTF) Algorithm Sinhala
▶︎

SJF Preemptive (SRTF) Algorithm Sinhala

Red Black Tree & Hash Tables: Advanced Data Structures & Algorithms Kuppi 01
▶︎

Red Black Tree & Hash Tables: Advanced Data Structures & Algorithms Kuppi 01

Queue and Circular Queue || Data Structure and Algorithms || Undergraduate SE CS
▶︎

Queue and Circular Queue || Data Structure and Algorithms || Undergraduate SE CS

Full Binary Tree and Complete Binary Tree Explained in Sinhala || DSA || Undergraduate IT CS SE
▶︎

Full Binary Tree and Complete Binary Tree Explained in Sinhala || DSA || Undergraduate IT CS SE

Dijkstra Algorithm - Single Source Shortest Path - Greedy Method Explained in Sinhala|| UG CS
▶︎

Dijkstra Algorithm - Single Source Shortest Path - Greedy Method Explained in Sinhala|| UG CS