i have done this code but i don’t know how to to do these 2function so i need help in them 1)i need

Need your ASSIGNMENT done? Use our paper writing service to score better and meet your deadline.


Order a Similar Paper Order a Different Paper

i have done this code but i don’t know how to to do these 2function so i need help in them 1)i need a function that print only the (even) number indescending order (without using array ) because its a tree 2)i need a function to compute and return the sum of all (odd)numbers stored in the tree ((recursive)) ((in C programming language )) #include “tree.h”void insertNode(TreeNodePtr *treePtr, int value){ // if tree is empty if(*treePtr == NULL){ *treePtr = malloc(sizeof(TreeNode)); //if memory was allocated, then assign data if(*treePtr != NULL){ (*treePtr)->data = value; (*treePtr)->leftPtr = NULL; (*treePtr)->rightPtr = NULL; } else{ printf(“%d not inserted. No memory availablen”, value); } } else { if (value < (*treePtr)->data) insertNode(&((*treePtr)->leftPtr), value); else if (value > (*treePtr)->data) insertNode(&((*treePtr)->rightPtr), value); else printf(“%s”, “duplicate valuen”); }}// Inorder traversal of the treevoid inOrder(TreeNodePtr treePtr){ if(treePtr != NULL) { inOrder(treePtr->leftPtr); printf(“%3d”, treePtr->data); inOrder(treePtr->rightPtr); }} void preOrder(TreeNodePtr treePtr){ if(treePtr != NULL) { printf(“%3d”, treePtr->data); inOrder(treePtr->leftPtr); inOrder(treePtr->rightPtr); }} void postOrder(TreeNodePtr treePtr){ if(treePtr != NULL) { inOrder(treePtr->leftPtr); inOrder(treePtr->rightPtr); printf(“%3d”, treePtr->data); }} . . .