LEETCODE 222: COUNT COMPLETE TREE NODES | SOLUTION 2 WAYS | C++

This is one of common questions asked in #SoftwareEngineerInterview of #GOOGLE #FACEBOOK.
This video contains the explanation and code for the problem #CountCompleteTreeNode in 2 Ways.
1. Bruteforce
2. Optimized solution.
Please do let me know if you have any inputs/concerns for the solution.
Also do like, share and Subscribe :) Keep Learning Everyday :)
Try solving this problem here: leetcode.com/problems/count-complete-tree-nodes/
Find all my Leetcode solutions here: kzbin.info/aero/PLod2hJhyen5fBGkRZelDtg5YBVgd8aSvx
Subscribe at kzbin.info
Follow me here: nikash_nikx
Thank you

[@mohneeshgarg8706]

I think both approaches are o(n), as it can we solved using o(logn) time, so please try to include that part also.

[@NikashKumar]

sure , will do, pretty soon.

[@shalomnaim007]

What is the time complexity of this solution?

[@NikashKumar]

O(n)