Series: Convert Data Structure Problems & Follow-Up Posted on August 13, 2018October 20, 2019 by braindenny Convert Data Structure problems CheatSheet: Leetcode For Code Interview 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: #series LintCode: Convert Linked List to Array ListLintCode: Convert Array List to Linked ListLeetcode: 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