How to print the keys of a B tree in a tree fashion ?

Question

0.00/5 (No votes)

See more:

int k = 200 ; // defined in same class as the function print .

         public void print ( BNode n )      
        {
        for ( int k = temp ; k>=0 ; k=k-30 )
        {
            System.out.print("     ");
        }
        
        for ( int i = 0 ; i < n.count ; i++ ) 
        {
            System.out.print ( n.getValue(i) + " " ) ;    
        }
        
        
        
        if ( !n.leaf )  
        {
               System.out.println ("") ;
            
            for ( int j = 0; j <= n.count ; j++ )
            {				  
                temp = temp -- ;
               
                if ( n.getChild(j) != null ) 
                {			         
                 
                    print( n.getChild(j) ) ;     
            
                }
              
            }
            
        }
    
    }

I am not able to think of a way to print the key values in a tree fashion . I want the root node to be at the middle , children nodes starting from the next line and left most child to the left of the root and so on .

Please help .

What I have tried:

Implemented the code in Java .

Posted 28-Apr-18 2:44am

Member 13616463

Updated 28-Apr-18 5:56am

Add a Solution

Comments

Richard MacCutchan 28-Apr-18 9:49am

You would need to build a list of all the nodes first, calculating their relative positions in the tree. Once you have that information you can calculate where on your printout that you need to position each one in the tree diagram.

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)

Patrice T · Answer 1 · 2018-04-28T05:57:00

A B-tree is a structure, basically, a node that contain a value and 2 pointers to 2 child nodes. The trick is that each child tree is a B-tree itself.
in this B-tree

 1
2
 3

is a B-tree by itself with just an indentation.
A B-tree can have an unlimited depth, so the most obvious solution is to use recursion.
you just have to keep track of indentation level.