Trie is a very simple data structure. I coded it back in java as a
component of the software. If you want the code then here it is:
class Node{
boolean isFinal;
Node[] link;
int id;
Node parent;
int group;
static int numNodes = 0;
boolean has
Sorry the example should be
file1 = sec2 -> sec7->sec9 -> sec11 -> null
file2 = sec10 -> sec12-> null
as first sector contains the file information.
google don't hear DFS or linear parsing, give me the code ;)
On May 27, 11:28 am, Atul Kumar wrote:
> There is a fi
There is a file system on the disc. the disc has many sectors. Always
the first sector has the information about all the files.
A file data is divided into sectors. Each sector can have data from a
single file.
Each sector has 2 parts, data and the pointer to the next sector of
the file. Every la
array and linked list are not the same so all solutions based on array
are wrong.
think this way : how to print(or append in a linked list) the binary
search tree in the sorted order -- the answer is in-order traversal.
you need to do opposite of it here.
On May 12, 10:17 am, divya jain wrote:
