Tree/BinaryTreeNonRecursivePost.c
StackNode* initStack() {
    StackNode* S = (StackNode*)malloc(sizeof(StackNode));
    S->data = NULL;
    S->next = NULL;
    return S;
}
/**
 * init stack
 * @return the pointer of stack
 */
init stack
@return the pointer of stack
init stack @return the pointer of stack
StackNode* initStack() {
    StackNode* S = (StackNode*)malloc(sizeof(StackNode));
    S->data = NULL;
    S->next = NULL;
    return S;
}
StackNode * initStack ( ) { StackNode * S = ( StackNode * ) malloc ( sizeof ( StackNode ) ) ; S -> data = NULL ; S -> next = NULL ; return S ; }
init stack
 @return the pointer of stack
init stack @return the pointer of stack