数据结构
Bryan要加油
这个作者很懒,什么都没留下…
展开
-
225.Implement Stack using Queues
Implement the following operations of a stack using queues. push(x) -- Push element x onto stack.pop() -- Removes the element on top of the stack.top() -- Get the top element.empty() -- Return whet原创 2015-06-27 10:47:46 · 355 阅读 · 0 评论 -
208.Implement Trie (Prefix Tree)
Implement a trie with insert, search, and startsWith methods. Note: You may assume that all inputs are consist of lowercase letters a-z. class TrieNode { public: // Initialize your data s原创 2015-06-30 08:48:24 · 360 阅读 · 0 评论 -
把二元查找树转变成排序的双向链表
题目:输入一棵二元查找树,将该二元查找树转换成一个排序的双向链表。要求不能创建任何新的结点,只调整指针的指向。 比如将二元查找树 10 / \转载 2015-07-16 18:30:54 · 361 阅读 · 0 评论