Problem $1$:

A$.$Implementing a file system structure using a tree data structure.

Code of the this can be implemented using Tree not necessarily Binary Search Tree

Explanation, and Screenshot of the code snippets

B$.$Implement a binary search tree $($BST$)$

$$: Insert, Search delete and Traversal $.$

Step by step explanation of the code for all the functions $,$classes with the screenshots of the code and output

C$.$Singly linked list and a doubly linked list

Singly Linked List: insert$\_$front$($value$),$insert$\_$end$($value$),$delete

$($value$)$and display$()$

$$ Step by step explanation of the code for all the functions $,$classes with the screenshots of the code and output

Doubly Linked List: insert$\_$front$($value$),$delete$($value$),$display$()$and reverse$\_$display$()$

Step by step explanation of the code for all the functions $,$classes with the screenshots of the code and output