Following *Tree Traversing Techniques* can be used to print a *Binary Search Tree* (BST);

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

**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 *Descending Order*?

×

Problem Loading...

Note Loading...

Set Loading...