1.

Define tree traversal and list some of the algorithms to traverse a binary tree.

Answer»

The PROCESS of VISITING all the nodes of a TREE is known as tree TRAVERSAL.

Some of the algorithms to traverse a binary tree are as follows:

  • Pre-order Traversal.
  • In order Traversal.
  • Post order Traversal.
  • Breadth FIRST Search
  • ZigZag Traversal.


Discussion

No Comment Found