Leetcode 222. Count Complete Tree Nodes (Medium) (cpp)

Leetcode 222. Count Complete Tree Nodes (Medium) (cpp)

Tag: Binary Search, Tree

Difficulty: Medium

/*

222. Count Complete Tree Nodes (Medium)

Given a complete binary tree, count the number of nodes.

Definition of a complete binary tree from Wikipedia:
In a complete binary tree every level, except possibly the last, is completely filled, 
and all nodes in the last level are as far left as possible. It can have between 1 and 
2h nodes inclusive at the last level h.

*/
/**
 * Definition for a binary tree node.
 * struct TreeNode {
 *     int val;
 *     TreeNode *left;
 *     TreeNode *right;
 *     TreeNode(int x) : val(x), left(NULL), right(NULL) {}
 * };
 */
 class Solution {
 public:
 	int countNodes(TreeNode* root) {
 		if (!root) return 0;
 		int h = 0, sum = 0;
 		TreeNode *t = root, *t0 = NULL;
 		while (t) {
 			t = t -> left;
 			h++;
 		}
 		t = root;
 		int level = h - 2;
 		while (level > -1) {
 			t0 = t -> left;
 			for (int i = 0; i < level; i++) 
 				t0 = t0 -> right;
 			if (t0) {
 				sum += 1<<level;
 				t = t -> right;
 			} else t = t -> left;
 			level--;
 		}
 		if (t) sum++;
 		return sum+((1<<(h-1))-1);
 	}
 };