Commvault visited our campus for SED . First round was coding round .in this round they gave 5 question.
- Print the binary search tree in zig zag way.
- Swap two node in given link list.
- Find the sum of the just smallest element of the array if their is not smallest element exist before the given element then take 0.
- Write a code to form the largest number by permutation of the given number and print all number which is greater.
- Can’t remember.