6. Constructing a binary search tree -- based on the un-balanced BST algorithms covered in class -- from inserting the values 5, 2, 9, 6, 3, 8, 1 in that order. In what order are the values visited in a preorder traversal of the resulting tree? A. 9,8,6,5,3,2,1 B. 5,3,2,1,9,8,6 C. 3,5,2,9,1,8,6 D. 5,2,1,3,9,6,8
最新发布