I have to display a binary search tree in a tree format.
For BST insertion, if the input contains the following
The resulting BST should be displayed as:
F +-- D | +-- NULL | \-- NULL \-- R +-- P | +-- M | | +-- NULL | | \-- N | | +-- NULL | | \-- NULL | \-- NULL \-- V +-- NULL \-- NULL
Please help,how to display like this.