Construct a binary search tree from the given sequence of integers a1, a2, ak. If the tree already contains number, insert it to the right subtree. Find and print the sum of nodes with just two sons. Input One line contains sequence a1, a2, ..., ak (read till the end of the file). Output Find and print the sum of nodes with just two sons.

Sample input 10 14 20 10 14 10 14 22

Sample Output: 34

Write  java code for this question.

Answer rating: 100% (QA)

class Node int data Node left right public Nodeint item data item left right null class BinarySearch... View the full answer