Binary Search Tree Part 1of 2 | BST | Implementation in C | Insertion | Deletion | code explained

Data Structures and Algorithms: Binary Search Tree Implementation in C (Part 1 of 2)

This video covers the representation of a Binary Search Tree in detail.
The code is done in C programming language.
Insert, delete, display in inorder traversal, display in postorder traversal, display in preorder traversal, counting total number of nodes and counting total number of leaf nodes are explained with code.

Link for Part 2 of 2 : Binary Search Tree Implementation in C

Link for the more related videos:
Binary Tree Traversal | Inorder | Preorder | Postorder
Stack Introduction and operations on stack
Representation of stack using array
Representation of stack using linked list
Queue Introduction, operations and types
Queue using array
Linked list program using C - part 1
Linked list implementation Part2
Linked list implementation Part3