Series: Convert Data Structure Problems & Follow-Up Posted on August 13, 2018July 26, 2020 by braindenny Convert Data Structure problems CheatSheet: Leetcode For Code Interview CheatSheet: Common Code Problems & Follow-ups Questions Name Example Implement a queue supporting enqueue, dequeue and findmax operations Implement a stack supporting push, pop, getmin, getavg, getmostfrequent Implement a queue using two stacks See all series problems: #convertds LintCode: Convert Linked List to Array ListLintCode: Convert Array List to Linked ListLeetCode: Serialize and Deserialize N-ary TreeLeetCode: Serialize and Deserialize BSTLeetCode: Serialize and Deserialize Binary TreeLeetCode: Convert Sorted List to Binary Search TreeLeetCode: Convert BST to Greater TreeLeetCode: Convert Binary Search Tree to Sorted Doubly Linked List See more blog posts. Post Views: 5