CountingFullNodes.java

[aarzoopundir]

Issue Id you have worked upon -

Kindly write your answer here

Briefly explain your program logic -

Full nodes are the ones whose left and right children are not null. So the idea is to traverse the tree in postorder. If the current node is full, we increment result by 1 and add returned values of left and right subtrees.

Screenshots(Attach 2 screenshots of your own input and output) -

Attach here

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 -

• [] I have mentioned the question as comment in my solution file.
  

• [] My code follows the guidelines of this project.
  

• [] I have performed a self-review of my own code.
  

• [] I have commented my code.
  

• [] My code gives the correct output.
  

• [] 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.
  

• [] I affirm that I strictly follow contributing guidelines and code of conduct.

[SarthakKeshari]

@aarzoopundir, 13 files have been altered leading to conflicts in the repo. Kindly look into it

[SarthakKeshari]

@aarzoopundir, 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.