yodifm / binary-trees

A repository that focuses especially on solutions to complicated problems on Binary Trees

Binary Trees ❗❗

• Hacktober Fest 🔥🔥

  We hereby welcome coders who wish to contribute to Open Source and participate in Hacktober Fest 2020.
  We are looking for Quality and not Quantity

• About the Repository

  This repository aims at providing solutions to the famous questions on Binary Trees in as many languages as possible.
  You can get good questions on Binary Trees from sites like
  1. GeekForGeeks
  2. InterviewBit
  3. LeetCode
  4. HackerEarth
  5. HackerRank

• Beginners

  This repository especially focuses on helping beginners through the Hacktober Fest🔥🔥.
  If you are an absolute beginner and want to contribute then check out CONTRIBUTING.md

• Guidelines for Contribution

  1. Fork the Repository
  2. Add, edit or enhance code in whichever Language you want
  3. If a language folder isn't present in the repository, feel free to add it.
  4. All codes must be Binary Tree centric. As the name of the repository suggests, this repository is made especially for Binary Trees.
  5. No duplication, repitition and spamming. It will not lead to an accepted Pull Request.
  6. Once you are done with your contribution, issue a PULL REQUEST. The Maintainers may ask you for a few changes. Once everything seems good, your code will be pulled and added to the original Repository branch.

• No Duplication

  If a language folder, say C++, already has a code for a problem statement X, then no code will be accepted for the same problem statement X (in that language), until and unless you solve it with a different approach (in which case you need to explicity mention in the filename eg. Inorder_Using_Iteration.cpp )