Given the elements of binary tree in an array format. You need to return the number of possible ways to reorder the elements in the array such that the binary tree is similar to the older one.
Answers
Answered by
0
Answer:
Given an array, arr[] of size N consisting of elements from the range [1, N], that represents the order, in which the elements are inserted into a Binary Search Tree, the task is to count the number of ways to rearrange the given array to get the same BST.
Similar questions