# Tree Traversal 1

**Computer Science**Level 2

Following

**can be used to print a***Tree Traversing Techniques**Binary Search Tree*(BST);**Preorder traversal***(left) (right) root***Postorder traversal***root (left) (right)***Inorder traversal***(left) root (right)*

Which of them can be used to print a *Binary Search Tree* (BST) in *Ascending Order*?

##### this problem is apart of this set

**Your answer seems reasonable.**Find out if you're right!

Sign up to access problem solutions.

**That seems reasonable.**Find out if you're right!

Already have an account? Log in here.