Decision makers often have to choose alternatives which appear in an exogenous structure. For example, consider choosing a dish in a restaurant after going through different menu cards (a menu card for buffet, another for combo offers etc.). The decision maker observes the items displayed (as a list) on a menu card and she switches to another menu card to see the items displayed on it (again in the form of another list). Thus the set of all items appears as an "ordered-tree" to the decision maker. There are other examples of decision making where alternatives appear in the form of an ordered-tree. In this paper we consider the cases of choice from ordered-trees (in particular, "lists of lists") and characterize the choice functions. We impose the axioms of Backward Consistency and Replacement Indifference on choice functions and obtain characterization results for k-ary ordered-trees and more general ordered-trees. We show that the results for k=2 are similar to those of (Rubinstein and Salant 2006), in which the cases of choice from lists are considered. However the results for k ≥ 3 and general ordered-trees are different and allow for instance, a richer class of tie-breaking rules in special cases. © 2013 Springer-Verlag Berlin Heidelberg.