## This problem is about finding the distance between two nodes of a strictly binary tree. Oh, is that too easy?! Ok, the tree is potentially infinite now. Keep it up and we will start going up the aleph numbers. In this problem, a tree is either a single node XX , or a node XX with two trees attached to it: a left subtree and a right subtree. In both cases, XX is the root of the tree. If the tree is not a single node, the roots of both the left and right subtrees are the only children of XX .

Infinitree codejam solution For Solution Click Here! This problem is about finding the distance between two nodes of a strictly binary tree. Oh, is that too easy?! Ok, the tree is potentially infinite now. Keep it up and we will start going up the aleph numbers. In this problem, a tree is either a single …