What do you understand by tree traversal?

The algorithm walks by the tree data structure and performs some computation at everynode in the tree. This process of walking by the tree is known as a tree traversal. 

 

Posted Date: 5/10/2013 4:08:38 AM | Location : United States

Ask an Expert

Related Discussions:- What do you understand by tree traversal, Assignment Help, Ask Question on What do you understand by tree traversal, Get Answer, Expert's Help, What do you understand by tree traversal Discussions

Write discussion on What do you understand by tree traversal
Your posts are moderated

Write your message here..

Related Questions

Algorithms and flowcharts, write an algorithm and draw a flowchart to calcu... write an algorithm and draw a flowchart to calculate the perimeter and area of a circle

Mapping constain, one to many one to one many to many many to one one to many one to one many to many many to one

Binary search tree, A binary search tree (BST), which may sometimes also be... A binary search tree (BST), which may sometimes also be named a sorted or ordered binary tree, is an edge based binary tree data structure which has the following functionalities:

Algorithms, b) The user will roll two (six-sided) dices and the user will l... b) The user will roll two (six-sided) dices and the user will lose the game if (s)he gets a value 1 on either any of the two dices & wins otherwise. Display a message to the user w

State the term access restrictions - container, What is Access Restriction... What is Access Restrictions Structured containers with access restrictions only allow clients to add, remove and examine elements at certain locations in their structure. For

Explain the term - branching, Explain the term - Branching There are t... Explain the term - Branching There are two common ways of branching: case of ..... otherwise ...... endcase  if ..... then ..... else ..... endif   case of

Explain Hashing, What do you mean by hashing? Hashing gives the direct ... What do you mean by hashing? Hashing gives the direct access of record from the file no matter where the record is in the file. This is possible with the help of a hashing func

Remainder function.., 3633(mod 11) 3633(mod 11)

Find a minimum cost spanning arborescence rooted, Find a minimum cost spann... Find a minimum cost spanning arborescence rooted at r for the digraph shown below, using the final algorithm shown in class. Please show your work, and also give a final diagram wh

Compound interest, Write the algorithm for compound interest Write the algorithm for compound interest