Q2) The is a binary tree, which has string values only on leaf nodes and all other nodes have empty values. Example is below. When you sum all the leaf node values from left to right. the values will be : example: abcdefghblahblahblahblah etc. Implement the below method that will give 'n'th character of the result. Example: find the 5th character. here it will be 'e'. (BLANK) |---------------------------^---------------------------| (BLANK) (BLANK) |-------------^-------------| |-------------^-------------| abc (BLANK) ijklmnopq rstuvwxyz |------| defgh // Strucutre of the Node with below implemented methods. class Node { Node getLeft(); Node getRight(); boolean isBlank(); String getData(); }
