数据结构
adjadv2012
这个作者很懒,什么都没留下…
展开
-
面向对象的堆实现
自己写的小根堆类 发现一个问题:堆并没有不允许出现重复元素这个性质,之前一直有错误的印象 当类中含有vector数据成员时,构造函数怎么写?答案是不写,交给vector的默认构造函数处理. #include #include using namespace std; template class MinHeap{ //int* heap; /原创 2014-03-30 16:06:52 · 383 阅读 · 0 评论 -
LeetCode OJ: Binary Tree Postorder Traversal
转战LeetCode,开始不适应,只好先从简单的题目开始 Given a binary tree, return the postorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return原创 2014-03-20 10:47:53 · 364 阅读 · 0 评论 -
LeetCode: Binary Tree Preorder Traversal
Given a binary tree, return the preorder traversal of its nodes' values. For example: Given binary tree {1,#,2,3}, 1 \ 2 / 3 return [1,2,3]. Note: Recursive solu原创 2014-03-20 13:56:51 · 315 阅读 · 0 评论 -
LeetCode: Binary Tree Level Order Traversal II
Given a binary tree, return the bottom-up level order traversal of its nodes' values. (ie, from left to right, level by level from leaf to root). For example: Given binary tree {3,9,20,#,#,15,7},原创 2014-03-20 12:06:25 · 459 阅读 · 0 评论