Algorithm for tracing the path in a full binary tree

Question

1.00/5 (3 votes)

See more:

C

given a full binary tree find i and jth positions and also find the path and trace the movements.

Posted 14-Apr-15 23:04pm

Member 11503119

Add a Solution

Comments

phil.o 15-Apr-15 5:22am

What have you tried? Where are you stuck?

1 solution

Add a Solution

Add your solution here

Treat my content as plain text, not as HTML

Preview 0

…

Existing Members

Sign in to your account

...or Join us

Download, Vote, Comment, Publish.

Your Email
Password
Forgot your password?

Your Email
This email is in use. Do you need your password?
Optional Password

I have read and agree to the Terms of Service and Privacy Policy
Please subscribe me to the CodeProject newsletters

When answering a question please:

Read the question carefully.
Understand that English isn't everyone's first language so be lenient of bad spelling and grammar.
If a question is poorly phrased then either ask for clarification, ignore it, or edit the question and fix the problem. Insults are not welcome.
Don't tell someone to read the manual. Chances are they have and don't get it. Provide an answer or move on to the next question.

Let's work to help developers, not make them feel stupid.

This content, along with any associated source code and files, is licensed under The Code Project Open License (CPOL)

KarstenK · Answer 1 · 2015-04-14T23:30:00

you must only log all operation step after step in a matter which suites your needs. You must only log whether you choose the left or the right node. So you will left with a log like "LRLRRR" or "010111". If you save the depth of your tree walk you can use bit shift operations.

Sounds like a teenager homework. :-O