#CodeChallenge Youngest common ancestor in a graph

YoungestAncestor.cpp

#include <vector>
using namespace std;

class AncestralTree {
public:
  char name;
  AncestralTree *ancestor;

  AncestralTree(char name) {
    this->name = name;
    this->ancestor = NULL;
  }

  void addAsAncestor(vector<AncestralTree *> descendants);
};

int getTopAncestorDepth(AncestralTree *descendant, AncestralTree *topAncestor) {
	int depth = 0;
	while (descendant->name != topAncestor->name) {
		depth++;
		descendant = descendant->ancestor;
	}
	return depth;
}

AncestralTree* commonAncestorHelper(AncestralTree* youngest, AncestralTree* older, int diff) {
	while (diff != 0) {
		youngest = youngest->ancestor;
		diff--;
	}
	cout << youngest->name << endl;
	while (youngest->name != older->name) {
		youngest = youngest->ancestor;
		older = older->ancestor;
	}
	return youngest;
}

AncestralTree *getYoungestCommonAncestor(AncestralTree *topAncestor,
                                         AncestralTree *descendantOne,
                                         AncestralTree *descendantTwo) {
  int depthOne = getTopAncestorDepth(descendantOne, topAncestor);
	int depthTwo = getTopAncestorDepth(descendantTwo, topAncestor);
	if (depthOne > depthTwo) {
		return commonAncestorHelper(descendantOne, descendantTwo, depthOne - depthTwo);
	} else {
		return commonAncestorHelper(descendantTwo, descendantOne, depthTwo - depthOne);
	}
}