Coding question - given a binary tree, write code to count the sum off all siblings.

Question

reckoner · Accepted Answer

int totalNumberOfNodes(Node root) {
  if(root == null)
    return 0;
  return 1 + totalNumberOfNodes(root.left) + totalNumberOfNodes(root.right);
}

Romain · Answer

private int siblingCounter = 0;

public int countSiblings(BinaryNode node)
{
	if(node.element == null)
	{
		return siblingCounter;	
	}
	else
	{
		siblingCounter++;
		
		if(node.right() != null)
		{		
			countSiblings(BinaryNode right);
		}
		
		if(node.left() != null)
		{
			countSiblings(BinaryNode left);
		}		
	}
	
	return siblingCounter;	
}

needajob · Answer

Not sure if this works...
value == null)
			return $sum;
		$sum = $sum + $tree->value;
		countSiblings($tree->left,$sum);
		countSiblings($tree->right,$sum);
	}
?>

Amazon

Question d’entretien chez Amazon

Réponses aux questions d'entretien

Entreprises suivies

Recherche d’emplois