Tree Traversal 1

Computer Science Level 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 Ascending Order ?

this problem is apart of this set
None of them Inorder traversal Posrorder traversal Preorder traversal

Zeeshan Ali by Zeeshan Ali , 25, Pakistan

This section requires Javascript.
You are seeing this because something didn't load right. We suggest you, (a) try refreshing the page, (b) enabling javascript if it is disabled on your browser and, finally, (c) loading the non-javascript version of this page . We're sorry about the hassle.

1 solution

Zeeshan Ali
Dec 21, 2015

For solution and better understandings come here

0 Helpful 0 Interesting 0 Brilliant 0 Confused

0 pending reports

×

Problem Loading...

Note Loading...

Set Loading...