Create a function in C that returns a new tree, representing the union of two given trees. For example Tree1 can have va

[answerhappygod]

Create a function in C that returns a new tree, representing theunion of two given trees. For example Tree1 can have values 1, 2, 3and Tree2 can have values 4, 5, 6 the function should return a newTree3, containing values 1,2,3,4,5,6.
Also create a function in C that returns a new tree,representing the intersection of two given trees. For example Tree1can have values 1, 2, 3 and Tree2 can have values 4, 2, 1, 6 thefunction should return a new Tree3, containing values 1, 2.
Write a function in c that prints out the elements of a binarysearch tree in the following format {number1, number2, number3,number4}. Each number is separated by a whitespace and a comma. ITHAS TO HAVE THE EXACT FORMAT WITH BRACKETS, COMMAS AND WHITESPACES.It is inputted a tree in its function call and will be a voidfunction as it's printing.
You cannot use arrays or linked lists for these questions, haveto use binary search trees.