DSA CODES

 1 BST 2 BFS DFS 3 NON LINEAR DATA STRUCTURE/ MAX HEAP/ INTERNSHIP/ SORT STUDENT GRADE 4 DIVIDE AND CONQUER 5 PRIMS AND KRUSHKALS ALGO 6 DIJKISTRAS ALGO/ BELLMON FOR 7 GRAPH COLORING / N QUEENS 8 BRANCH N BOUND FOR TSP N KNAPSACK 0/1      1. Aim : Create a binary search tree (BST) of and perform following operations: i) Insert ii)Display inorder iii)Search a node iv) Find height of the tree v) level wise display iv) Delete v) Mirror Code:        #include <iostream>        using namespace std;        struct Node       {        int data;        Node* left;        Node* right;        Node(int val) : data(val), left(nullptr), right(nullptr) {}       };      ...