DS Lab: Binary Trees Assignment Video (Lecture Follow-up)

📌 Java Data Structures Lab – Binary Trees Assignment This video presents the full assignment for the Binary Trees lecture, covering: - Preorder, Inorder, and Postorder traversals - Binary tree construction - Recursive tree operations 💡 Activities for Students (to implement independently): 1. Calculate the height of a binary tree 2. Perform level order traversal 3. Check if a binary tree is height balanced 4. Build a tree from preorder & inorder arrays 5. Find the deepest node Make sure you carefully review each requirement before implementing your solutions. 💻 Reference Materials: - Lecture examples & explanations: GitHub repo: https://github.com/Maryam-Skaik/java-ds-lab-trees - Activities folder contains starter templates for all assignment tasks ▶ Instructions for Students: 1. Watch the full video to get all assignment questions. 2. Solve each task independently before submitting. 3. Do not share solutions online. 4. Maintain proper code structure, naming conventions, and clean logic. 5. Follow constraints exactly (use recursion and tree operations as required). This is part of the Data Structures Lab series – Binary Trees Module. Follow along in your IDE (NetBeans / VS Code / IntelliJ) and try each activity. #Java #DataStructures #BinaryTree #TreeTraversal #Preorder #Inorder #Postorder #Recursion #DSLab #JavaProgramming #BinaryTreeAssignment #LevelOrderTraversal #HeightBalancedTree #LCA #MaryamSkaik #DSLabAssignments #ComputerScienceLab #JavaTutorial