Sign Up

Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.

Have an account? Sign In

Have an account? Sign In Now

Sign In

Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.

Sign Up Here

Forgot Password?

Don't have account, Sign Up Here

Forgot Password

Lost your password? Please enter your email address. You will receive a link and will create a new password via email.

Have an account? Sign In Now

You must login to ask a question.

Forgot Password?

Need An Account, Sign Up Here

Please briefly explain why you feel this question should be reported.

Please briefly explain why you feel this answer should be reported.

Please briefly explain why you feel this user should be reported.

Sign InSign Up

The Archive Base

The Archive Base Logo The Archive Base Logo

The Archive Base Navigation

  • SEARCH
  • Home
  • About Us
  • Blog
  • Contact Us
Search
Ask A Question

Mobile menu

Close
Ask a Question
  • Home
  • Add group
  • Groups page
  • Feed
  • User Profile
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Buy Points
  • Users
  • Help
  • Buy Theme
  • SEARCH
Home/ Questions/Q 6981051
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 27, 20262026-05-27T18:06:23+00:00 2026-05-27T18:06:23+00:00

I need to write a binary tree to HDFS, which i will use to

  • 0

I need to write a binary tree to HDFS, which i will use to represent a desicion tree. But in order to do that i first need to create a BinaryTreeNode class, which will be the tree node. These are my class attributes:

private String name;
private String attribute;
private String attType;
private String condition;
private String lines;
private BinaryTreeNode leftChild;
private BinaryTreeNode rightChild;

So now i need to implement the write and readFields methods for reading and writing these nodes. These are what i have done:

public void write(DataOutput d) throws IOException 
{
    d.writeUTF(name);
    d.writeUTF(attribute);
    d.writeUTF(attType);
    d.writeUTF(condition);
    d.writeUTF(lines);
    //SOMETHIN FOR LEFT AND RIGHT CHILD
}

public void readFields(DataInput di) throws IOException 
{
    name=di.readUTF();
    attribute=di.readUTF();
    attType=di.readUTF();
    condition=di.readUTF();
    lines=di.readUTF();
    //SOMETHIN FOR LEFT AND RIGHT CHILD
}

BinaryTreeNode read(DataInput in) throws IOException
{
     BinaryTreeNode ob = new BinaryTreeNode();
     ob.readFields(in);
     return ob;
}

What i cant think of is how to write and read my 2 child nodes. Note that the tree is going to be build recursively and every node will have 0-2 childs. So my later purpose is to have a BinaryTree class that will have the attribute BinaryTreeNode root. Thanks

  • 1 1 Answer
  • 0 Views
  • 0 Followers
  • 0
Share
  • Facebook
  • Report

Leave an answer
Cancel reply

You must login to add an answer.

Forgot Password?

Need An Account, Sign Up Here

1 Answer

  • Voted
  • Oldest
  • Recent
  • Random
  1. Editorial Team
    Editorial Team
    2026-05-27T18:06:24+00:00Added an answer on May 27, 2026 at 6:06 pm

    Ok i found the solution. I dont know if it is efficient enough but it works. Here is what i did. These are in my class definition:

        public void write(DataOutput d) throws IOException
        {
          d.writeUTF(name);
          d.writeUTF(attribute);
          d.writeUTF(attType);
          d.writeUTF(condition);
          d.writeUTF(lines);
          ObjectWritable left=new ObjectWritable(BinaryTreeNode.class,leftChild);
          left.write(d);
          ObjectWritable right=new ObjectWritable(BinaryTreeNode.class,rightChild);
          right.write(d);
        }
    
        public void readFields(DataInput di) throws IOException
        {
          name=di.readUTF();
          attribute=di.readUTF();
          attType=di.readUTF();
          condition=di.readUTF();
          lines=di.readUTF();
          leftChild=(BinaryTreeNode) ObjectWritable.readObject(di, new Configuration());
          rightChild=(BinaryTreeNode) ObjectWritable.readObject(di, new Configuration());
    
        }
    

    And this is how i use them:

    For writing:

          BinaryTreeNode bla=new BinaryTreeNode();
          //set the attributes
          ObjectWritable obj=new ObjectWritable(BinaryTreeNode.class,bla);
          obj.write(dos);
    

    For reading:

          BinaryTreeNode bla=new BinaryTreeNode();
          bla= (BinaryTreeNode) ObjectWritable.readObject(in, conf);
    

    This works fine. Now i am able to create my decision tree and store it just by storing my root. 😀

    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I need to write a method that prints a binary tree by using recursion.
I need write an update statement that used multiple tables to determine which rows
I need to read and write binary data in C++.I use from ofstream and
I have a binary string that I need to write to a file. I
I need to write a program used internally where different users will have different
I need to write a Java Comparator class that compares Strings, however with one
I need to write a Delphi application that pulls entries up from various tables
I need to write code that picks up PGP-encrypted files from an FTP location
I need to write an extension method on a byte[]. Is that possible?
I need to write a small tool that parses a textual input and generates

Explore

  • Home
  • Add group
  • Groups page
  • Communities
  • Questions
    • New Questions
    • Trending Questions
    • Must read Questions
    • Hot Questions
  • Polls
  • Tags
  • Badges
  • Users
  • Help
  • SEARCH

Footer

© 2021 The Archive Base. All Rights Reserved
With Love by The Archive Base

Insert/edit link

Enter the destination URL

Or link to existing content

    No search term specified. Showing recent items. Search or use up and down arrow keys to select an item.