Assume any tree [Binary/BST/B tree] the tree will allow undo operation whenever a change is made in any of data for last three stages. Demonstrate with suitable example.
Detailed Description:-
This project contains menu driven program for Btree and Bst for insertion,deletion and undo operation within the [Btree/BST]
Technology Stack: - The entire coding is done in Java with NetBeans IDE 8.0.1.
Classes and Functions: - The program makes the use of 2 classes: -
- Btree
- BST
1.Btree: - The class that is used to insert,delete and undo operation into the Btree.
2.BST: - The class that is used to insert,delete and undo operation into the binary search tree.
The Program shows menu driven program which ask user what to do at every itteration. operation
- insertion
- deletion
- undo operation
- search
- display tree