Design and analysis of algorithms

void insertNode(TreeNodePtr *treePtr, int value)\ if (treePtr is empty) allocate memorv and put here else if (valuedata) insert at the left tree else insert at the right tree void insertNode( TreeNodePtr *treePtr, int value ) { if ( *treePtr NULL) \ *treePtr- malloc( sizeof( TreeNode ) ); if( *treePtr != NULL) { (*treePtr)->data - value; (*treePtr )->leftPtr- NULL; (*treePtr )->rightPtr- NULL; else printf( "No memory available. n"); } else if ( value data) insertNode( &( ( *treePtr )->leftPtr ), value ); else if ( value > (*treePtr)->data) insertNode( &( ( *treePtr)->rightPtr), value); else printf( "dup"); void postOrder( TreeNodePtr treePtr) if(treePtr != NULL ) { postOrder( treePtr->leftPtr); postOrder( treePtr->rightPtr); printf( "%2d", treePtr-data ): Problem Implement the function to find the largest and least elements in the binary tree: void max(TreeNodePtr *treePtr, int *largest, int *least)