+module TS : sig
+ type t
+ val empty : t
+ val cons : Tree.Binary.t -> t -> t
+ val append : Tree.Binary.t -> t -> t
+ val concat : t -> t -> t
+ val to_list_rev : t -> Tree.Binary.t list
+ val length : t -> int
+ val iter : (Tree.Binary.t -> unit) -> t -> unit
+ val rev_iter : (Tree.Binary.t -> unit) -> t -> unit
+ val find : (Tree.Binary.t -> bool) -> t -> Tree.Binary.t