#Leetcode 222. Count Complete Tree Nodes | #JavaScript

#Leetcode 222. Count Complete Tree Nodes | #JavaScript
#BinarySearch

[tsuyuasui]

var countNodes = function(root) {
const left =(node)=>{
if(!node) return 0;
return left(node.left)+1;
}
const right =(node)=>{
if(!node) return 0;
return right(node.right)+1;
}
const trans=(node)=>{
let l = left(node)
let r = right(node)
if (l === r){
return Math.pow(2, l)-1
}
return trans(node.left) + trans(node.right)+1
}
return trans(root)
};

[julianoamadeulopesmoura]

Nice solution, but very poor time complexity analysis.
Your argument that it is O((logn)**2) just because there are two O(logn) traversals being performed does not explain anything.