i have been given the following task
Program Description:
Write an application to show graphically the following functions of a binary search tree.
a) Insertion in a tree using Breadth first insertion showing the status of queue and current pointer during
each insertion.
![B)]()
Searching in a tree by highlighting each node in the path or by moving current pointer etc.
Specifications
The program will read minimum of 6 values from user and maximum of 10.
You have to first read values then create binary search tree showing each step by labeling / highlighting root and curr pointer( if any in your code, or the way you like) as well as queue at each step during insertion .
Also provide the code (without graphical simulation) for traversing the tree by using any of traversal of your choice
The code should be properly designed by using the concept of data structures (use of user defined classes like stack etc).
but my question is that should i include the Binary Search Tree class and the circle function or simply make the circle function such that it graphically appears as a binary tree ?
Program Description:
Write an application to show graphically the following functions of a binary search tree.
a) Insertion in a tree using Breadth first insertion showing the status of queue and current pointer during
each insertion.
Searching in a tree by highlighting each node in the path or by moving current pointer etc.Specifications
The program will read minimum of 6 values from user and maximum of 10.
You have to first read values then create binary search tree showing each step by labeling / highlighting root and curr pointer( if any in your code, or the way you like) as well as queue at each step during insertion .
Also provide the code (without graphical simulation) for traversing the tree by using any of traversal of your choice
The code should be properly designed by using the concept of data structures (use of user defined classes like stack etc).
but my question is that should i include the Binary Search Tree class and the circle function or simply make the circle function such that it graphically appears as a binary tree ?