Recursively Traverse Binary Tree

Question

This is probably a simple task for expert coders, but is it possible to recursively traverse a binary unordered tree to find a node?

I can do this for a binary search tree, but I'm struggling with how to do this when the tree is unoredered since I can't figure out how to traverse back up when a node is not found in a branch...

C++ would he helpful.

Thanks guys.

why do you have an unbalanced/unordered tree? surely the point of a binary tree is for really fast searches. — Antony Scott
– Antony Scott, Commented Feb 23, 2012 at 20:13
What have you done so far? Do you have any code you can show us to show what you tried? — FloppyDisk
– FloppyDisk, Commented Feb 23, 2012 at 20:15

aviad · Accepted Answer · 2012-02-23 20:15:21Z

1

use iteration. pseudo code below:

ITERATIVE-TREE-SEARCH(x, k)
 while x ≠ NIL and k ≠ key[x]
     do if k < key[x]
           then x ← left[x]
        else x ← right[x]
 return x

answered Feb 23, 2012 at 20:15

aviad

8,2789 gold badges55 silver badges100 bronze badges

Sign up to request clarification or add additional context in comments.

Collectives™ on Stack Overflow

Recursively Traverse Binary Tree

1 Answer 1

Comments

Your Answer

Hot Network Questions

Collectives™ on Stack Overflow

1 Answer 1

Comments

Your Answer

Sign up or log in

Post as a guest

Related