Log in Sign up

Home
RGPV
CSE
4th Semester
CS-402
Unit 6 Notes

CS-402 Analysis Design of Algorithm Unit 6 Notes

Notes and important questions for unit 6: Tree and Graph Data Structures, Traversals and NP‑Completeness.

Unit 6 · Short notes Tree and Graph Data Structures, Traversals and NP‑Completeness Binary search trees · Height‑balanced trees (AVL) · 2‑3 trees and B‑trees · Tree traversal techniques (in‑order, pre‑order, post‑order) · Graph traversal algorithms (DFS, BFS) · Fundamentals of NP‑completeness

More for CS-402

Analysis Design of Algorithm subject page

Other 4th semester CSE subjects

All CSE 4th semester subjects