To write a program in C that simulates a UNIX-based file-system, and using a tre

Question

To write a program in C that simulates a UNIX-based file-system, and using a tree structure (except slightly modified using a linked list sort of data structure to indicate files in a directory), what would be the best way to go about this? It is a tree; but instead of having left and right child, it is setup to initially be the username as the first directory then the root (protected nodes, e.g. it would be initialized joeschmoe/root/). We want to be able to manipulate any files and directories created, deleted, or (hard link) duplicated. So the struct would look like a root node (actually username node) then pointing to root (protected), and then allow the user to create directories and files as necessary (simulated, not actual files and directories). The directories (alphabetized) can be empty or contain files (alphabatized) in a linked list kind of fasion, but using a tree structure. What is (in whoever answers this) the best data structures and file organization methods to be able to do this and take commands like a terminal would in UNIX?

Explanation / Answer

C Program to Implement Binary Tree using Linked List

This C Program implements binary tree using linked list. Binary Search tree is a binary tree in which each internal node x stores an element such that the element stored in the left subtree of x are less than or equal to x and elements stored in the right subtree of x are greater than or equal to x. This is called binary-search-tree property

Here is source code of the C Program to implement binary tree using linked list. The C program is successfully compiled and run on a Linux system. The program output is also shown below.

output:

2. Code for Binary Tree Sorting in C Programming

Related Questions

Navigate

• Browse (All)
• Browse T
• Subjects

Integrity-first tutoring: explanations and feedback only — we do not complete graded work. Learn more.