- 博客(3)
- 收藏
- 关注
RSS订阅原创 二叉树后序遍历的非递归算法
void PostOrderTraversal(TreeNode* binTree) { TreeNode* tree = binTree; LinkStack* stack = CreateLinkStack(); TreeNode* tempNode = NULL; while (tree || !IsEmpty(stack)) { w
2015-03-31 13:19:49
763
1
原创 03-树1. List Leaves (25)
#include #include typedef int ElementType;struct TreeNode{ ElementType data; TreeNode* left; TreeNode* right;};TreeNode* CreateTreeNode(){ TreeNode* node = (TreeNode*) malloc(sizeof(TreeNode)); node->
2015-03-25 21:31:52
524
原创 PAT 02-线性结构3. Pop Sequence (25)
http://www.patest.cn/contests/mooc-ds2015spring/02-%E7%BA%BF%E6%80%A7%E7%BB%93%E6%9E%843 Given a stack which can keep M numbers at most. Push N numbers in the order of 1, 2, 3, ..., N and pop rando
2015-03-25 21:30:08
1203
空空如也
空空如也
TA创建的收藏夹 TA关注的收藏夹
TA关注的人