C Program to Find Minimum in BST | BST in C | DSA Project Presentation

Описание: 📌 Title: Finding the Minimum Key in a Binary Search Tree using C
Submitted By: Samartha Banerjee
Roll No: 241003003020
University: Techno India University
Subject: Data Structures and Algorithms
Project Type: Mini Project / Lab Presentation
Programming Language: C

Description:
This video explains how to implement a Binary Search Tree (BST) in the C programming language and how to find the minimum key value by traversing the tree to the leftmost node.

The project covers:
BST structure and properties
Node creation and insertion
Function to find the minimum node
Time and space complexity analysis
Output demonstration

✅ This project helped reinforce my understanding of tree traversal, pointers, and memory management in C.

📖 References:
“Data Structures Using C” by Reema Thareja
www.geeksforgeeks.org
Class notes and lecture materials

📅 Submitted for internal evaluation as part of the DSA course curriculum.

#CProgramming #DSA #BinarySearchTree #TechnoIndiaUniversity #BST #UniversityProject