My solution to Tree Walker Exercise

[Ming Wei]

nextNode = function(node) {

  if (node.firstChild) {

    return node.firstChild;

  }

  while (node && !node.nextSibling) {

    node = node.parentNode;

  }

  if (node) {

    node = node.nextSibling;

  }

  return node;

};