Back to all chapters
# Trees

Whether you're working with a road map or just some numerical data, organizing data in trees allows for an efficient representation of connections and hierarchies.

**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...