1. A linearization extension of a rooted tree is an enumeration of the tree nodes where the descendants always come later in the enumeration than their ancestors. As an example, the tree below has two linear extensions – ABC and ACB.
Write a C program that takes an n-ary tree as an input and outputs the number of linear extensions for that tree.
2. Write a C Program to perform in-order traversal of a binary tree in all the following 3 ways--
a. With recursion.
b. Without recursion but with a stack.
c. Without recursion and without a stack. You may augment your tree data structure with extra storage that is less than 4 bits per node.
5 los freelancers están ofertando un promedio de $47 para este trabajo.
I am ready to Start Working Now i have enough experience to deal with the project and i will do a professional work just give me the chance to show what i can do