Tree/BinaryTreeNonRecursivePost.c
void push(TreeNode* data, StackNode* S) {
    StackNode* node = (StackNode*)malloc(sizeof(StackNode));
    node->data = data;
    node->next = S->next;
    S->next = node;
}
/**
 * push stack
 * @param data the pointer of data node you want to push
 * @param S the pointer of stack
 */
push stack
@param data the pointer of data node you want to push
@param S the pointer of stack
push stack @param data the pointer of data node you want to push @param S the pointer of stack
void push(TreeNode* data, StackNode* S) {
    StackNode* node = (StackNode*)malloc(sizeof(StackNode));
    node->data = data;
    node->next = S->next;
    S->next = node;
}
void push ( TreeNode * data , StackNode * S ) { StackNode * node = ( StackNode * ) malloc ( sizeof ( StackNode ) ) ; node -> data = data ; node -> next = S -> next ; S -> next = node ; }
push stack
 @param data the pointer of data node you want to push
 @param S the pointer of stack
push stack @param data the pointer of data node you want to push @param S the pointer of stack