N2K TECH
🎓 Welcome to N2K Tech — Turning Notes into Knowledge!
I’m Harsh, a self-study engineer documenting my entire learning journey — from BTech subjects to coding, projects, and personal growth.
📘 Here you’ll find:
Simplified explanations of BTech Notes & Core Subjects
Coding & Project Tutorials
Real Self-Study Experiences & Tips
💡 My mission is simple — to help students learn smarter, not harder. Whether you’re studying at home or in college, N2K Tech will help you Learn • Code • Grow 🚀
🔔 Subscribe and be part of my learning community!
DSA Unit 5 – BFS, DFS, Spanning Tree & Minimum Spanning Tree Explained | Algorithms & Examples
DSA Unit 5 – Graph Basics | Terminology, Adjacency Matrix & Adjacency List | AKTU Notes
DSA Unit 4 – Huffman Tree Example Explained | Construct Huffman Code + Disk Space Calculation
DSA Unit 4 Part 8 : B-Tree Algorithm, Example & Binary Heap (Min/Max Heap)
DSA Unit 4 Part 7 : B-Tree | Example Explained #learncodegrow #video #btree #dsa
DSA Unit 4 | AVL Tree (Part 6) | Algorithm & Example #learncodegrow #education #avltree
Huffman Coding in DSA 🌳 | Approach, Working & Example | Unit 4 AKTU Notes #notes #DSA
DSA Unit 4 Part 4: Binary Search Tree (BST) & Threaded Binary Tree | Algorithm, Types & Advantages
DSA Unit 4 - Part 3: Binary Tree Representation & Traversals | Array, Linked List, PYQs
DSA Unit 4 Part 2: Binary Tree | Properties & Types Explained
DSA Unit 4 Part 1: Tree Data Structure | Terminology & Properties Explained
DSA Unit 3 Part 5: Radix Sort & Hashing | Algorithm, Types & Collision Techniques #algorithm #btech
DSA Unit 3 Part 4: Merge Sort & Heap Sort | Algorithm & Example Explained #aktu #notestoknowledge
DSA Unit 3 Part 3: Bubble Sort & Quick Sort | Algorithm & Example Explained
DSA Unit 3 Part 2: Sorting & Its Types | Insertion Sort & Selection Sort |AKTU 3rd Semester #sorting
DSA Unit 3 Part 1: Searching & Its Types | Linear, Binary & Index Sequential Search
DSA Unit 2 (Part 6) : Dequeue, Priority Queue & Circular Queue Program | Data Structures
DSA Unit -2 (Part - 5) Queue in DSA 🔥 | Circular Queue | Enqueue & Dequeue Algorithm Explained
DSA Unit 2 (Part 4) : Recursion & Tower of Hanoi | Concept, Example & Algorithm | AKTU Notes
DSA Unit 2 (Part - 3 ) Infix to Postfix Conversion using Stack 🔥 | Algorithm & Example Explained
DSA Unit - 2 (Part -2 ) Stack in Real Life | 7 Applications of Stack Explained with Examples #stack
UNIT -2 (Part - 1 )Stack in DSA | Push & Pop Operations Explained with Algorithm | AKTU B.Tech Notes
Polynomial Addition Using Linked List 🔥 | C Program & Explanation | DSA Notes AKTU #aktu #youtube
DPDPA 2023 Explained 🔥 | Digital Personal Data Protection Act | Cyber Security Notes AKTU
Intellectual Property Rights (IPR) & Cyber Criminals 🔥 | Types & Importance | Cyber Security Notes
Malloc, Calloc, Overflow & Underflow in DSA 🔥 | Linked List Insertion Program Explained #n2ktech
Arrays & Linked Lists in DSA 🔥 | Single, Double & Circular Linked Lists, Sparse Matrix | Btech Notes
Internet Security Policy (ISP) in Cyber Security 🔥 | Meaning, Components & Benefits | AKTU Notes
Cyber Security Unit 1 - Part 2 | Copyright & Patent Explained | B.Tech 3rd Semester AKTU #n2ktech
Cyber Security Unit 1 - Part 1 | Internet Security & CIA Triad | B.Tech 3rd Semester AKTU #viral