Closed hsiav4 closed 3 years ago
@hsiav4, Kindly create an issue first and then PR. And follow the PR template and contribution guidelines. Create PR for one question at a time.
@hsiav4, This PR will be marked as invalid and be closed by 13/10/2021(6PM). Kindly respond by either closing it or making the required changes.
File: Binary Tree Inorder Traversal Question: Given the root of a binary tree, return the inorder traversal of its nodes' values
File: Linked List Cycle Question: Given head, the head of a linked list, determine if the linked list has a cycle in it
File: Linked List Cycle II Question: Given the head of a linked list, return the node where the cycle begins. If there is no cycle, return null
File: Same Tree Question: Given the roots of two binary trees p and q, write a function to check if they are the same or not
File: Symmetric Tree Question: Given the root of a binary tree, check whether it is a mirror of itself
Briefly explain your program logic -
Code for five Leetcode problems about binary trees has been added.
Checklist:
Eg - If your code follow the below guidelines. Kindly change [] to [x]
All the conditions should be fulfilled for considering your code for merging -
[x] I have mentioned the question as comment in my solution file.
[x] My code follows the guidelines of this project.
[x] I have performed a self-review of my own code.
[x] I have commented my code.
[x] My code gives the correct output.
[x] I confirm that I have not copied the code from anywhere. In case its found that I have copied even after successful merge then I can be banned from the repository and hacktoberfest.
[x] I affirm that I strictly follow contributing guidelines and code of conduct.