CS6311-PDS II LAB MANUAL
12. Binary Search Tree
13. Tree traversal Techniques
14. Minimum Spanning Trees
15. Shortest Path Algorithms
TOTAL: 45 PERIODS
At the end of the course, the student should be able to:
Design and implement C++ programs for manipulating stacks, queues, linked lists, trees,
Apply good programming design methods for program development.
Apply the different data structures for implementing solutions to practical problems.
Develop recursive programs using trees and graphs.