https://github.com/codenkoffee/csen301-quizzes-3
https://github.com/codenkoffee/csen301-quizzes-3
Last synced: 4 months ago
JSON representation
- Host: GitHub
- URL: https://github.com/codenkoffee/csen301-quizzes-3
- Owner: CodeNKoffee
- Created: 2023-12-08T08:25:32.000Z (over 2 years ago)
- Default Branch: master
- Last Pushed: 2024-01-02T20:59:23.000Z (over 2 years ago)
- Last Synced: 2024-12-31T00:33:44.099Z (over 1 year ago)
- Language: Java
- Size: 38.1 KB
- Stars: 1
- Watchers: 1
- Forks: 0
- Open Issues: 0
-
Metadata Files:
- Readme: README.md
Awesome Lists containing this project
README
# Binary Tree DSA Questions Repository
Welcome to the Binary Tree DSA Questions Repository! This repository is structured to provide a range of questions related to Binary Trees in Java, categorized by different difficulty levels.
## Overview:
This repository includes questions categorized into different levels, each focusing on specific aspects of Binary Tree concepts. The naming convention for the questions is as follows:
- **LEVEL 1:** Fundamental concepts and basic tree structures sourced from GeekForGeeks, past POP Lab assignments, or custom-made questions.
- **LEVEL 2:** Intermediate level questions sourced from GeekForGeeks, past POP Lab assignments, or custom-made questions.
- **LEVEL 3:** Advanced level questions sourced from GeekForGeeks, past POP Lab assignments, or custom-made questions.
- **LEVEL UNDETERMINED - POP LAB:** Challenging questions sourced from the POP Lab, covering various operations on binary trees.
- **LEVEL UNDETERMINED - CUSTOM MADE:** Unique challenges created by the author to test and enhance your understanding of Binary Trees.
---
**NOTE:** The determination of the difficulty level for each question is indicated through comments at the top of each question file. Look for comments such as `// LEVEL 1`, `// LEVEL 2`, or `// LEVEL 3`, `etc` to identify the difficulty level of a particular question.
---
Feel free to explore questions across different levels and categories to improve your proficiency in Binary Tree data structures. Happy coding!