Subject of choice: Data Structures
Questions:
- What is a BST?
- How will you traverse it?
- What is topological sorting?
- Where can you observe topological sorting in real life?
- Which BST traversal algorithm will give you exact/close approximation to topological sort?
- How will you modify the traversal algorithm to approximate topological sort? ( Couldn’t ans this well)
- Suppose you have an acyclic graph and there are two nodes which do now have an edge between them does swapping the two nodes have an effect on correctness of topological ordering?
Programming: WAP to find max element in linked list.
