|All-time Popular Problems|
|Maximum difference between node and its ancestor|
|Right View of Binary Tree|
|Delete without head pointer|
|Find the number of islands|
|Delete nodes having greater value on right|
|Reverse Level Order Traversal|
|Binary Tree to DLL|
|Find all pairs with a given sum|
|n'th node from end of linked list|
|Equal to product|
Given a Binary Search Tree of size N, that may be unbalanced. Your task is to complete the function buildBalancedTree(), that convert the given BST into a balanced BST that has minimum possible height.
Input: 30 / 20 / 10 Output: 20 / \ 10 30 Input: 4 / 3 / 2 / 1 Output: 3 3 2 / \ / \ / \ 1 4 OR 2 4 OR 1 3 OR .. \ / \ 2 1 4
The function takes a single argument as input, the reference pointer to the root of the Binary Search Tree.
There are T, test cases and for each test case the function will be called separately.
For each test case output will be the new height of the BST.
30 20 10
10 8 7 6 5
Note:The Input/Ouput format and Example given are used for system's internal purpose, and should be used by a user for Expected Output only. As it is a function problem, hence a user should not read any input from stdin/console. The task is to complete the function specified, and not to write the full code.