please check the harded coded tree in that include $20$ also because in output $20$ should also come $.$The output of the previous code was $1030505560.$But the expected output is $102030505560.$tree.node.left.right$=20$

$($Note:I want this code in java with proper explation using comments in java code and Coding Practices:$1.$Formatting and Indentation Package Structures and Class Structures$\mathrm{.}2.$Separate driver class which will be used to create objects $,$Taking Input Coding Logic, Output$\mathrm{.}3.$Seperate class for bussiness logic.Dont write the bussiness logic in driver class$)$

You are working in an MNC$,$ which manages the Transactions, where only BST is used as a

Data Structure. The company stores all the data of transactions in BST such that the tree is

always a complete BST$.$

A new business requirement has arrived where the BST should not contain any left node.

You are required to modify the existing BST and display the node values present in ascending

order.

Hint: $($ Convert the Binary Search Tree into a Skewed Tree$).$

Output

$102030505560$

Instructions

You can hardcode the tree as follows

Main tree $=$ new Main$()$;

tree.node $=$ new Node$(50)$;

tree.node.left $=$ new Node$(30)$;

tree.node.right $=$ new Node$(60)$;

node.left.left $=$ new Node$(10)$;

tree

tree.node.right.left$=$ new Node$(55)$;

Learning Objectives:

$1.$ Work and enhance logical skills to write efficient scripts.

$2.$ Apply the concepts of Binary Trees and any required DSA concepts to solve the

problems.