Given two binary search trees, return elements of both binary search trees in sorted form.
1) complete the function Merge() which takes roots of both binary search trees as its parameter and returns the binary search tree in a sorted order that merges the node values of both binary search trees

2) complete the function Main() that creates two trees below and outputs an array of integers denoting the node values of the merged binary search tree in breadth-first traversal. You are allowed to define other functions, such as buildtree(), breadthFirstTraversal().

 

Transcribed Image Text:

1 2 1 3 1 LO 5 2 + 3 2 4 1 1.0 5 4 2 7 7 9 9

Answer rating: 100% (QA)

Merge Two Balanced Binary Search Trees and return elements of both binary search trees in sorted for View the full answer