Interview Questions Part 1

• ·         Traverse a binary tree
• ·         Reverse every k-element in a linked list
• ·         Find the combination of elements with sum as N.
• ·         Find the duplicates in Linked List
• ·         Print binary tree in level order
• ·         Validation of parenthesis in string (Total number should be equal for “(“ and “)”  )
• ·         Swap the nodes in binary tree.
• ·         Print Binary tree in pre order/post order/ inorder
• ·         Stack operations using O(1)
• ·         Implement Queue Using Linked List
• ·         Merge Sort implementation.
• ·         How to find the linked list is circular or not.
• ·         Find the repeated values in String.