 The sequence of steps constructed in this way does not depend on whether "a"/"b" is given in lowest terms, and forms a path from the root to a node containing the number "a"/"b".This fact can be used to prove that each positive rational number appears exactly once in this tree.For example, 3/4 can be found by starting at the root, going to the left once, then to the right twice