|All-time Popular Problems|
|Max sum in the configuration|
|Searching a number|
|Immediate Smaller Element|
|Next greater number set digits|
|Lowest Common Ancestor in a BST|
|Largest Number formed from an Array|
|Leaders in an array|
|Add two numbers represented by linked lists|
|Reverse words in a given string|
Given a binary tree, Your task is to complete the function largestBst that returns the size of the largest subtree which is also a Binary Search Tree (BST). If the complete Binary Tree is BST, then return the size of whole tree.
The task is to complete the method which takes one argument, root of Binary Tree. The Node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.
The function should return the size of the max subtree which is also the BST.
1 <=T<= 30
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
Example(To be used only for expected output):
3 2 L 3 4 R
10 20 L 10 30 R 20 40 L 20 60 R
There are two test cases. First case represents a tree with 3 nodes and 2 edges where root is 3, left child of 3 is 2 and right child of 3 is 4. Second test case represents a tree with 4 edges and 5 nodes.
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.