CS301 Data Structures Quiz Set 2

👉 CS301 = Data Structures​

iska matlab:​

data ko smart tareeke se store + fast access + kam time me kaam

🔹 CS301 FINAL TERM = KIS CHEEZ SE AATA HAI?

Mostly ye topics aate hain (aur paper yahin se banta hai): 1️⃣ Trees (Binary Tree, BST)​ 2️⃣ Sorting (Bubble, Selection, Insertion, Merge)​ 3️⃣ Searching (Binary Search)​ 4️⃣ Heap​ 5️⃣ Hashing​ 6️⃣ Graphs (thora sa)

👉 Main ab ek road map follow karunga:

1. ​ Pehle basic concept​
2. ​ Phir exam wali baat​
3. ​ Phir short trick ya formula​

✅ TOPIC 1: TREE KYA HOTA HAI? (Basic se)

🔹 Tree ka matlab?

Socho family tree 🌳

1. ​ upar father​
2. ​ neeche children​

Computer me bhi same cheez hoti hai.

🔹 Binary Tree kya hota hai?

Binary ka matlab = sirf 2 ➡️ Har node ke:

1. ​ ya to 0​
2. ​ ya 1​
3. ​ ya 2 children hotay hain​

2 se zyada nahi​

🔹 Node kya hota hai?

Node = ek box jisme:

1. ​ data hota hai​
2. ​ pointers hotay hain (left, right)​

🔹 Root kya hota hai?

Tree ka sab se upar wala node = Root

🔹 Leaf node kya hota hai?

Jis node ke koi bachay nahi hotay​ ➡️ usay kehte hain Leaf / External Node

🔹 Internal node kya hota hai?

Jis node ke bachay hotay hain​ ➡️ usay kehte hain Internal Node

⭐ EXAM GOLD FORMULA (YAAD KAR LO)

Binary Tree me: External Nodes = Internal Nodes + 1

Example:

1. ​ Internal = 50​
2. ​ External = 51​

➡️ Guaranteed MCQ / short question

✅ TOPIC 2: BINARY SEARCH TREE (BST)

BST = special binary tree

🔹 Rule (bohot important):

1. ​ Left side = chota​
2. ​ Right side = bara​

5 < 10​ 20 > 10 ➡️ Is rule ki wajah se search fast hoti hai

🔹 BST me searching fast kyun?

Kyunke:

1. ​ har step pe half data reject​