Still celebrating National IT Professionals Day with 3 months of free Premium Membership. Use Code ITDAY17

x
Solved

# Traversal in Binary tree in c++

Posted on 2009-03-30
Medium Priority
949 Views
there is a three line code using recursion for inorder traversal . I am not able to understand the logic.  the code is :

in(node *p)
if(p!=NULL)
{
in(p->l);
cout << p->data;
in(p->r);
}

I can understand that the flow is towards the last node which is less than  the root where both the left and right are null.  How the pointer climbs from left to root and then to right.  Please explain
0
Question by:abdul_mujeeb
[X]
###### Welcome to Experts Exchange

Add your voice to the tech community where 5M+ people just like you are talking about what matters.

• Help others & share knowledge
• Earn cash & points
1 Comment

LVL 46

Accepted Solution

Kent Olsen earned 1500 total points
ID: 24018241
Hi abdul,

It help a lot if you can visualize the tree.  Here's a sorted tree as an example:

6
/   \
3     8
/   \     \
1    4     9
\
2

Note that all of the sort rules apply.  All of the child nodes to the left of the node are smaller, all of the child nodes to the right are larger.

Using your small function, we start at root.  Root has a value of 6, and most importantly, a left child.  So the function recursively calls itself passing the left child (value 3).

Now the process is repeated with 3 as the current node.  3 has a left child so the function recursively calls itself passing the left child (value 1) and the process repeats again.

The node with a value of 1 does not have a left child.  Still, the function calls itself passing the left child (NULL).  The function detects the NULL and simply returns.  Now the fun starts.  :)

Upon returning to the function that is using the node with a value of 1, the function prints the value to output.  It then calls inselft passing the right child (value 2).

The node with a value of 2 doesn't have a left child so the call is again trivial as it simply returns.  The function then prints the value to output and calls itself with the right child which is also NULL and simply returns to the call that is processing the node with a value of 2.

That call (value 2) returns to the caller (value 1) which returns to its caller (value 3).  It then prints 3 to output and processes the right child (value 4).

That process continues until the entire tree is displayed.

Good Luck,
Kent
0

## Featured Post

Question has a verified solution.

If you are experiencing a similar issue, please ask a related question

In our object-oriented world the class is a minimal unit, a brick for constructing our applications. It is an abstraction and we know well how to use it. In well-designed software we are not usually interested in knowing how objects look in memory. …
How to install Selenium IDE and loops for quick automated testing. Get Selenium IDE from http://seleniumhq.org Go to that link and select download selenium in the right hand column That will then direct you to their download page. From that p…
The viewer will learn how to use NetBeans IDE 8.0 for Windows to connect to a MySQL database. Open Services Panel: Create a new connection using New Connection Wizard: Create a test database called eetutorial: Create a new test tabel called ee…
THe viewer will learn how to use NetBeans IDE 8.0 for Windows to perform CRUD operations on a MySql database.
###### Suggested Courses
Course of the Month5 days, 2 hours left to enroll