二叉树的遍历(含统一格式遍历)
//非递归前序遍历void preorderTraversal(TreeNode *root, vector<int> &path){ stack<TreeNode *> s; TreeNode *p = root; while(p != NULL || !s.empty()) { while(p != NULL)...