title: What defines the leftmost an rightmost nodes of a non-binary tree?
body: <p>I've been searching the web and can't find an answer to this. How can you find the leftmost/rightmost nodes of a tree with an arbitrary number of child nodes per node? </p>
  
  <p>In a binary search tree this would presumably be the smallest and the greatest values in the tree. How would this work when any node can have any number of child nodes?</p>