|All-time Popular Problems|
|Delete keys in a Linked list|
|Delete Middle of Linked List|
|Max sum in the configuration|
|Given a linked list of 0s, 1s and 2s, sort it.|
|Top View of Binary Tree|
|Linked List Insertion|
|Boundary Traversal of binary tree|
|n'th node from end of linked list|
Given an array A, your task is to do some operations, i.e., search an element, insert an element, and delete an element by completing the functions. Also, all functions should return
First line of input consists if T, number of test cases. First line of every test case consists of an integer N, denotes the number of elements in an array. Second line of every test cases consists of N spaced integers Ai. Third line of every test case consists of three integers X ,Y , Yi and Z, denoting the elements for search operation, insert operation , insert opearion element inedx and delete operation respectively.
Return 1 for each operation if done successfully else 0.
2 4 1 0 6
1 2 2 0
1 1 1