|All-time Popular Problems|
|Inorder Successor in BST|
|Depth First Traversal for a Graph|
|Delete nodes having greater value on right|
|Column name from a given column number|
|Search an Element in an array|
|Diameter of Binary Tree|
|Get minimum element from stack|
|Subset Sum Problem|
|Reverse words in a given string|
|Reverse a linked list|
Given a binary search tree and a number N. Your task is to complete the function findMaxforKey(), that find's the greatest number in the binary search tree that is less than or equal to N. Print the value of the element if it exists otherwise print -1.
Input : N = 24 Output :result = 21 (searching for 24 will be like-5->12->21) Input : N = 4 Output : result = 3 (searching for 4 will be like-5->2->3)
The function takes two argument as input, the reference pointer to the root of the binary search tree and integer value N.
There will be T, test cases and for each test case the function will be called separately.
For each test case print the greatest number in the binary search tree that is less than or equal to N
5 1 3 7 9
5 2 1 3 12 9 21 19 25