#Compilation procedure:

To test Multiwalk tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DMULTI_WALK -DARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test Binary tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DARRAY -DBINARY_TREE_USING_ARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test Binary search tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DARRAY -DBINARY_SEARCH_TREE_USING_ARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test LCRS tree:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DLCRS ./tree/*.c testTree.c -o testTree

To test Binary tree using node:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DBINARY_TREE_USING_NODE ./tree/*.c testTree.c -o testTree

To test Binary search tree using node:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DBINARY_SEARCH_TREE_USING_NODE ./tree/*.c testTree.c -o testTree

Compilation procedure:

To test Multiwalk tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DMULTI_WALK -DARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test Binary tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DARRAY -DBINARY_TREE_USING_ARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test Binary search tree using list:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DARRAY -DBINARY_SEARCH_TREE_USING_ARRAY ./list/*.c ./tree/*.c testTree.c -o testTree

To test LCRS tree:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DLCRS ./tree/*.c testTree.c -o testTree

To test Binary tree using node:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DBINARY_TREE_USING_NODE ./tree/*.c testTree.c -o testTree

To test Binary search tree using node:

1. Sit in code folder,

2. Run command, gcc -Wall -g -I. -DBINARY_SEARCH_TREE_USING_NODE ./tree/*.c testTree.c -o testTree

1. Does the code structure that involves conditional compilation, at function level, looks maintainable? If no, can the code get further structured that minimizes conditional compilations?

2. As per this declaration, void inOrderTraversal(Tree *, visitFunc); inOrder traversal is applied on N-ary tree(N>2). As per this answer, does it practically make sense to apply on other than a binary tree?

3. Further, PriorityQueue abstraction code will not be part of tree directory, by definition. It will sit in codedirectory. Please confirm the correction of this approach.

1. Does the code structure that involves conditional compilation, at function level, looks maintainable? If no, can the code get further structured that minimizes conditional compilations?

2. As per this declaration, void inOrderTraversal(Tree *, visitFunc); inOrder traversal is applied on N-ary tree(N>2). As per this answer, does it practically make sense to apply on other than a binary tree?

3. Further, PriorityQueue abstraction code will not be part of tree directory, by definition. It will sit in codedirectory. Please confirm the correction of this approach.

1. Priority queue can be implemented efficiently using LCRS implementation of N-ary tree (N <= 2).

2. State propagation tree, shown here, can be implemented using multi walk tree

3. Ordered data can be maintained by a binary search tree

4. Expression trees can be implemented using a binary tree

1. Priority queue can be implemented efficiently using LCRS implementation of N-ary tree (N <= 2).

2. State propagation tree, shown here, can be implemented using multi walk tree

3. Ordered data can be maintained by a binary search tree

4. Expression trees can be implemented using a binary tree