- Define & Implement your own algorithm, to traverse a Binary Search Tree and print all the left children as well as also print the count of nodes who doesn't have left child.
- Write a program to check & justify the given statement.
- Pre order and post order traversal of Binary Search Tree shows following properties:
- Root element is placed at opposite end, i.e. in pre order root is the first element where as in post order root is the last element.
- They have common mid point, i.e. both the traversal will give same element at the mid position for odd number of nodes.
- Pre order and post order traversal of Binary Search Tree shows following properties:
- Implement an queue which follows some order using Linked list. For example create queue of student as per the roll number, in ascending order.
- Implement a queue to store pre - order successor of all the nodes of given binary search tree.
- Implement a circular queue to process the given list of students as per the following conditions:
- Element will be removed from the queue if its backLog counter contains is equal to zero.
- You can only process the front element, processing means "backLog - appearingCount".
- For any element appearing count will not be greater than 2.
Kindly DO NOT create the program in a single Main class. Try out some Object-Oriented Programming and use your skills from your software engineering classes as well.
Steps to attempt this assignment:
1. Fork this repository.
2. Clone the repository you forked to your computer.
3. Write code and commit it.
4. Push the code back to your fork.
5. paste the repository link on classroom
You can specify your own packages if require.
Please feel free to reach out to me in case of any queries.
*ctrl+c & ctrl+v from assignment 1