#include <deque>

#include <stack>

#include <iostream>

using namespace std;

struct BinaryTreeNode

};

void printTop2Bottom(BinaryTreeNode *pTreeRoot);

void init(BinaryTreeNode *rootNode)

}

void printTop2Bottom(BinaryTreeNode *pTreeRoot)

}

void doPrintZOrder (stack<BinaryTreeNode*>* printStack, stack<BinaryTreeNode*>* saveStack, bool leftChildFirst);

void printZOrder(BinaryTreeNode* rootNode) {

}

void doPrintZOrder (stack<BinaryTreeNode*>* printStack, stack<BinaryTreeNode*>* saveStack, bool leftChildFirst) {

}

void release(BinaryTreeNode* rootNode) {

}

int main()

}