conduct an in-order traversal to output the values In ascending order.
Types of Linked List
A sequence of data elements connected through links is called a linked list (LL). The elements of a linked list are nodes containing data and a reference to the next node in the list. In a linked list, the elements are stored in a non-contiguous manner and the linear order in maintained by means of a pointer associated with each node in the list which is used to point to the subsequent node in the list.
Linked List
When a set of items is organized sequentially, it is termed as list. Linked list is a list whose order is given by links from one item to the next. It contains a link to the structure containing the next item so we can say that it is a completely different way to represent a list. In linked list, each structure of the list is known as node and it consists of two fields (one for containing the item and other one is for containing the next item address).
As usual, your program will prompt for the name of an input file and the read and process the data contained in this file.
The file contains a sequence of integer values. Read them and construct a binary search tree from the values in the order they are read. Thus; the first number read will be the root of the tree.
For this exercise, you may use dynamic data, but it is better to store the numbers sequentially In an array.
You do not need to balance the tree as you construct it.
When you have read the last value into the BST, conduct an in-order traversal to output the values In ascending order.
Print them 10 to a line in a 5-character wide field.
Note: there may be duplicated value in the input file - in this case each copy of the number should be kept in the tree and output. E.g. if the input was 3 5 3, the output would be 3 3 5.
As usual, do not use classes or STL.
Needed the Solution in Python
Step by step
Solved in 2 steps
