Depth and Height of Binary tree?

Answer 1

height(node):

if node == null:

return 0

else:

max(height(node.L), height(node.R)) + 1

/*Function to print level order traversal of tree*/

getMaxWidth(tree)

maxWdth = 0

for i = 1 to height(tree)

width = getWidth(tree, i);

if(width > maxWdth)

maxWdth = width

return width

/*Function to get width of a given level */

getWidth(tree, level)

if tree is NULL then return 0;

if level is 1, then return 1;

else if level greater than 1, then

return getWidth(tree->left, level-1) +

getWidth(tree->right, level-1);

Answer 2

A complete binary tree is "a binary tree in which evert level, except possibly the deepest, is completely filled. At depth n, the height of the tree, all nodes must be as far left as possible."

According the the above definition by the NIST, this means that the minimum height of a complete binary tree is 1.