Tree Traversal 2

Following Tree Traversing Techniques can be used to print a 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 Descending Order?


this problem is apart of this set
×

Problem Loading...

Note Loading...

Set Loading...