Binary Search Tree To List Scheme -

i having trouble understanding how take in bst , convert list without using append or advanced techniques. example, given bst each node having number , name (sorted string smallest largest) , want output list, in order, of items in bst value of 3 or along these lines.

i understand can done recursively think biggest problem understanding has splitting of left , right nodes, because using recursion on both of these somehow have put them in final list.

any in understanding appreciated, thank in advance.

the short answer question is: you're right, need append. news is, (if you're doing assignment), can implement own append. if you're not doing part of assignment... use append directly!