DSA

I know it's too soon to tell but this is probably much harder than PD🙃
Yup. I'm right ;-;

while(time)
    if(!correct(design) || !pass(code))
        bei(meet);

CONTENTS

ASSG1:

1. Binary tree-LEVEL ORDER Insertion-PARENTHESIS REPRESENTATION(output)
2. Binary tree-PARENTHESIS REP(input)-COUSINS of a node
3. BST-No. of subtrees(which are BSTs)-Sum of nodes of a bst
4. BST-Insert-Delete-Search-Level of a node-Minvalue-Maxvalue-Predecessor-Successor-Traversals-(with parent node)
5. BST-k-th Smallest value

ASSG2:

1. Hash Table-Quadratic Probing, Double Hashing
2. Hash table-Separate Chaining
3. Hash-table-Separate Chaining-Lexicographical Order
4. BST-Parenthesis Rep-Predecessor-Successor-Inorder-kSmallest-kLargest-(without parent node)
5. BST-Max in path from a to b
6. BST-Balanced tree Insertion(O(nlogn)) from sorted list-Level Wise Sum

ASSG3:

1. AVLTree-Insert-Search-Delete-IsAVL-Rotations-Parenthesis print
2. AVLTree-Sorting-O(nlogm)
3. RBTree-Insert-Parenthesis Print
4. Binomial Heap-Insert-Delete-ExtractMin-Union

ASSG4:

1. print graph as list
2. kruskal-prim mst(sortedAdjList, disjSet)
3. bfs dfs (matrix)
4. fibHeap
5. 4 way disjoint set