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

Insertion into a red-black tree, The insertion procedure in a red-black tre... The insertion procedure in a red-black tree is similar to a binary search tree i.e., the insertion proceeds in a similar manner but after insertion of nodes x into the tree T, we c

What are the properties of colour, Properties of colour Colour descript... Properties of colour Colour descriptions and specifications generally include three properties: hue; saturation and brightness. Hue associates a colour with some position in th

How to construct binary tree, Q. A Binary tree comprises 9 nodes. The preor... Q. A Binary tree comprises 9 nodes. The preorder and inorder traversals of the tree yield the given sequence of nodes: Inorder :          E     A    C    K    F     H    D

Polynomials - represented by using arrays, /* the program accepts two polyn... /* the program accepts two polynomials as a input & prints the resultant polynomial because of the addition of input polynomials*/ #include void main() { int poly1[6][

What are the different ways of representing a graph, What are the different... What are the different ways of representing a graph? The different ways of representing a graph is: Adjacency list representation: This representation of graph having of an

Infix expression to postfix form using the stack function, Q. Convert the f... Q. Convert the following given Infix expression to Postfix form using the stack function: x + y * z + ( p * q + r ) * s , Follow general precedence rule and suppose tha

Stack, write pseudocode to implement a queue with two stacks write pseudocode to implement a queue with two stacks

The space - time trade off, The Space - Time Trade Off The best algorit... The Space - Time Trade Off The best algorithm to solve a given problem is one that needs less space in memory and takes less time to complete its implementation. But in practic

Splay trees, Addition of new records in a Binary tree structure always occu... Addition of new records in a Binary tree structure always occurs as leaf nodes, which are further away from the root node making their access slower. If this new record is to be ac

Computer applicatios, What are the features of an expert system What are the features of an expert system