Ad:

C++ Discussion Thread
Unsolved
Views: 11746

Aug 12th, 2007

Tree Traversal

Expand Post »

In order to traverse a tree you could use something like this:

For inorder traversal:

C++ Syntax (Toggle Plain Text)
 
inorder(TreeNode* currentNode)
{
    if (currentNode) {
       inorder(currentNode->LeftChild);
       cout << currentNode->data;
       inorder(currentNode->RightChild);
    }
}
inorder(TreeNode* currentNode)
{
    if (currentNode) {
       inorder(currentNode->LeftChild);
       cout << currentNode->data;
       inorder(currentNode->RightChild);
    }
}

For preorder traversal:

C++ Syntax (Toggle Plain Text)
preorder(TreeNode* currentNode)
{
    if (currentNode) {
        cout << currentNode->data;
        preorder(currentNode->LeftChild);
        preorder(currentNode->RightChild);
    }
}
preorder(TreeNode* currentNode)
{
    if (currentNode) {
        cout << currentNode->data;
        preorder(currentNode->LeftChild);
        preorder(currentNode->RightChild);
    }
}

For post order traversal:

C++ Syntax (Toggle Plain Text)
postorder(TreeNode* currentNode)
{
    if (currentNode) {
        postorder(currentNode->LeftChild);
        postorder(currentNode->RightChild);
        cout << currentNode->data;
    }
}
postorder(TreeNode* currentNode)
{
    if (currentNode) {
        postorder(currentNode->LeftChild);
        postorder(currentNode->RightChild);
        cout << currentNode->data;
    }
}

For level order traversal:

C++ Syntax (Toggle Plain Text)
LevelOrder(TreeNode* root)
{
   Queue q<TreeNode*>;
   TreeNode* currentNode = root;
 
    while (currentNode) {
        cout << currentNode->data;
        if (currentNode->LeftChild) q.Add(currentNode->LeftChild);
        if (currentNode->RightChild) q.Add(currentNode->RightChild);
        currentNode = q.Delete(); //q.Delete returns a node pointer
    }
}
LevelOrder(TreeNode* root)
{
   Queue q<TreeNode*>;
   TreeNode* currentNode = root;
       
    while (currentNode) {
        cout << currentNode->data;
        if (currentNode->LeftChild) q.Add(currentNode->LeftChild);
        if (currentNode->RightChild) q.Add(currentNode->RightChild);
        currentNode = q.Delete(); //q.Delete returns a node pointer
    }
}

The question is:

How can i make it a bit more graphical......
i mean that with the above methods the output is a list of numbers... is there anyway to modify this code so that i can have a nicer output?

PS: if you give example for one kind of traversal i will find the others by myself

Thanks again for your help....

Similar Threads

C++ complete binary tree using an array. Unexpected end file in C++
Tree traversal in Computer Science
binary tree traversal .. in C++
Binary Tree Traversal in C

n.aggel

Reputation Points: 23

Solved Threads: 12

Posting Whiz in Training

Offline

202 posts
since Nov 2006

Permalink

Aug 12th, 2007

Re: Tree Traversal

I don't think this is easy, the ones that I have seen that look half ok are the ones that plot the tree on its side.

The ones that work the best use a gdi. Drawing that in the console window is always going to be a pain in the ...

iamthwee

Featured Poster

Reputation Points: 1536

Solved Threads: 431

Posting Expert

Offline

5,865 posts
since Aug 2005

Permalink

Dec 4th, 2008

Re: Tree Traversal

I am currently working on a printout for level order for my data structures class. I will post it up here for you.

Last edited by Calvin'N'Hobbs; Dec 4th, 2008 at 5:27 pm. Reason: Typo

Calvin'N'Hobbs

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

1 posts
since Dec 2008

Permalink

Aug 19th, 2010

Re: Tree Traversal

C++ Syntax (Toggle Plain Text)
#
inorder(TreeNode* currentNode)
#
{
#
if (currentNode) {
#
inorder(currentNode->LeftChild);
#
cout << currentNode->data;
#
inorder(currentNode->RightChild);
#}
#
}
#
inorder(TreeNode* currentNode)
#
{
#
if (currentNode) {
#
inorder(currentNode->LeftChild);
#
cout << currentNode->data;
#
inorder(currentNode->RightChild);
#}
#
}

jbel

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Aug 2010

Permalink

Aug 19th, 2010

Re: Tree Traversal

1.
#
2.
inorder(TreeNode* currentNode)
3.
#
4.
{
5.
#
6.
if (currentNode) {
7.
#
8.
inorder(currentNode->LeftChild);
9.
#
10.
cout << currentNode->data;
11.
#
12.
inorder(currentNode->RightChild);
13.
#}
14.
#
15.
}

jbel

Reputation Points: 10

Solved Threads: 0

Newbie Poster

Offline

2 posts
since Aug 2010

This thread is more than three months old

No one has posted to this discussion for at least three months. Please let old threads die and do not reply to them unless you feel you have something new and valuable to contribute that absolutely must be added to make the discussion complete. Otherwise, please start a new thread in this forum instead.

Previous Thread in C++ Forum Timeline: Trying to obtain a number with a decimal

Next Thread in C++ Forum Timeline: nested this?

DaniWeb Message

Cancel Changes

User Name
Password