Knowledge in Tree
BFS tree
#include<iostream> #include <list> using namespace std; // This class represents a directed graph using // adjacency list representation class Graph { int V; // No. of vertices // Pointer to an array containing adjacency // lists list<int> *adj; public: Graph(int V); // Constructor // function to add an edge to graph void addEdge(int v, int w); // prints BFS traversal from a given source s void BFS(int s); }; Graph::Graph(int V) { this->V = V; adj = new list<int>[V]; } void Graph::addEdge(int v, int w) { adj[v].push_back(w); // Add w to v’s list. } void Graph::BFS(int s) { // Mark all the vertices as not visited bool *visited = new bool[V]; for(int i = 0; i < V; i++) visited[i] = false; // Create a queue for BFS list<int> queue; // Mark the current node as visited and enqueue it visited[s] = true; queue.push_back(s); // 'i' will be used to get all adjacent // vertices of a vertex list<int>::iterator i; while(!queue.empty()) { // Dequeue a vertex from queue and print it s = queue.front(); cout << s << " "; queue.pop_front(); // Get all adjacent vertices of the dequeued // vertex s. If a adjacent has not been visited, // then mark it visited and enqueue it for (i = adj[s].begin(); i != adj[s].end(); ++i) { if (!visited[*i]) { visited[*i] = true; queue.push_back(*i); } } } }
Rituparna Mazumder
Trees
Data Structure & Algorithm Tree
neelay choudhury
Data Structure (Doubly Linked List & Tree) (class notes)
It has various programs on the topic: Doubly Linked List Circular Doubly Linked List It also contains the topic "TREE". Types of Tree
Neelesh Kesarwani
Data Structure (Tree) (Class Notes)
It has everything related to the topic Tree of Data Structure.
Tree semester 2
For more resources please see other content
Shivam Barnwal
Tree for semester 2 -3
For more resources please see other content
DBMS INDEXING AND HASHING
Students of computer science, studying subject databases can refer to the notes below for reference and examination purpose. The attatchment includes topics of DBMS indexing and hashing such as Basic Concepts, Ordered Indices, B+-Tree Index Files, B-Tree Index Files, Static Hashing, Dynamic Hashing, Comparison of Ordered Indexing and Hashing, Index Definition in SQL, Multiple-Key Access, etc.
Learn Everyone
Design and Analysis of Algorithms (DDA)
This content is about Introduction to DDA, Binary tree, Dynamic Programming, Greedy Technique, Limitations of Algorithm Power, Sorting, Heap, Bionomial Heap, Fibonacci Heap, RBT- (Deletion , Insertion), Knapsack, Space & Time Complexity and many more topics.
Ayush Maheshwari