← Back to Home
Practice Binary Trees and Searching
Now it's time to practice what you learned!
You should have already created your Code Signal account. If you have not done so yet, please follow these instructions What is CodeSignal and How to Create Your Account
Tip: Before you dive into the practice tasks, revisit the core competency and guided project videos in this sprint.
Practice Modules
Binary Trees I
This module focuses on fundamental binary tree concepts and operations:
- Tree traversal: In-order, pre-order, and post-order
- Tree properties: Height, size, leaf count
- Binary search trees: Implementation and operations
Access ACS2M4 Practice Module
Binary Trees II
This module covers advanced binary tree operations:
- Level-order traversal: Breadth-first tree processing
- Path finding: Identifying and analyzing tree paths
- Complex tree operations: Balancing, rotation, validation
Access ACS2M5 Practice Module
Searching Algorithms
This module covers key searching algorithm implementations:
- Linear search: Sequential searching techniques
- Binary search: Efficient searching in sorted arrays
- Search algorithm analysis: Time and space complexity
Access ACS2M6 Practice Module
Challenge Problem (Bonus)
Test your advanced understanding with this challenge:
- Complex problem-solving: Combining trees and searching
- Algorithm optimization: Enhancing search performance
- Edge case handling: Managing complex tree structures
Access Bonus Challenge
Instructions
- Login to CodeSignal
- Click on the task links above
- Select your preferred language
- Click on NEXT to begin
- Agree with the Terms and Pledges and click START
Once all the questions for each task are completed in Code Signal, click on Finish the Test.
Remember to review the materials in Module 1: Binary Trees I, Module 2: Binary Trees II, Module 3: Searching, and Guided Project: Binary Trees for additional help.