DS Lab: Binary Trees Activities Solutions in Java – Traversals, Height, Balance & Construction 🌳

📘 Java Data Structures Lab – Binary Trees Activities (Full Solutions) This video presents complete, step-by-step solutions for the Binary Trees activities from the Data Structures Lab, using a generic BinaryTree implementation in Java. Each solution is explained clearly, focusing on recursion, traversal logic, and queue-based tree processing, with attention to edge cases and correctness. 🧩 Solutions Covered 1️⃣ Binary Tree Structure & Node Design ✔️ Generic BinaryTree and inner Node class ✔️ Left and right child references ✔️ Manual tree construction and controlled insertion 2️⃣ Tree Traversals - Preorder Traversal (Root → Left → Right) - Inorder Traversal (Left → Root → Right) - Postorder Traversal (Left → Right → Root) ✔️ Recursive implementation ✔️ Base case handling (root == null) 3️⃣ Height of Binary Tree ✔️ Recursive height calculation ✔️ Uses: 1 + max(height(left), height(right)) ✔️ Returns -1 for empty tree 4️⃣ Level Order Traversal (Breadth-First Search) ✔️ Implemented using a LinkedListQueue ✔️ Enqueues left and right children level by level ✔️ Demonstrates queue-based tree traversal 5️⃣ Check if Binary Tree is Height Balanced ✔️ Compares left and right subtree heights ✔️ Recursively checks all subtrees ✔️ Explains difference between exact balance and AVL balance 6️⃣ Build Binary Tree from Preorder & Inorder Traversals ✔️ Uses preorder index to select root ✔️ Splits inorder array into left and right subtrees ✔️ Recursive construction with index tracking 7️⃣ Find Deepest Node in Binary Tree ✔️ Uses level order traversal ✔️ Tracks last dequeued node ✔️ Correctly handles all tree shapes 📂 Code Repository (Solutions): https://github.com/Maryam-Skaik/java-ds-lab-trees All implementations shown in this video are available under: src/activities/ 🎯 How to Use This Video - Attempt each activity before watching - Focus on understanding recursion flow - Trace execution manually for better intuition - Test edge cases (empty tree, single node, skewed trees) This video is part of the Data Structures Lab – Binary Trees Module. Follow along in your IDE (NetBeans / VS Code / IntelliJ).