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 8123571
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 6, 20262026-06-06T06:13:25+00:00 2026-06-06T06:13:25+00:00

I have tree like following example, where every leaf is object. [1] |–[2] |

  • 0

I have tree like following example, where every leaf is object.

[1]
 |--[2]
 |   |--[3]
 |   |--[4]
 |       |--[5]
 |--[6]

Class structure is:

public class Node {
    private Integer id;
    private List<Node> children;
    public Integer getId()
    {
        return id;
    }
    public void setId(Integer id)
    {
        this.id = id;
    }
    public List<Node> getChildren()
    {
        return children;
    }
    public void setChildren(List<Node> children)
    {
        this.children = children;
    }
}

If leaf 3 is selected, then breadcrumbs are 1 2 3. How can I create breadcrumbs from this tree? I know how I can recursively create tree, but I don’t know how I can select correct leafs to breadcrumbs.

  • 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-06-06T06:13:27+00:00Added an answer on June 6, 2026 at 6:13 am

    You need a parent pointer in the children. When you add children, the parent node can set the children’s parent pointer to itself.

    public class Node {
        private Integer id;
        private Node parent;
        private List<Node> children;
        public Integer getId()
        {
            return id;
        }
        public void setId(Integer id)
        {
            this.id = id;
        }
        public List<Node> getChildren()
        {
            return children;
        }
        public void setChildren(List<Node> children)
        {
            this.children = children;
            for (Node child : children) {
                child.parent = this;
            }
        }
        public Node getParent() {
            return parent;
        }
    }
    

    You can then easily use this to build your breadcrumbs from a selected leaf node.

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

Sidebar

Related Questions

I have the following class and extension class (for this example): public class Person<T>
I have a tree-like object, managed by Hibernate. The object has a list of
I have a table that stores a tree like structure of file names. There
I have an ArrayList<Foo> structure in Java with standard tree-like fields: id , id_parent
I have huge data in a directory tree format like: c:/user/name/class/std/section I to VI
I am trying to have a javascript object tree behave like a php associative
I have a tree like structure created out of models using ForeignKey linkages. As
I have a git tree that looks like the following: Because of the review
I would like to use Infinispan following a tree like structure for the cache.
I'm trying to implement a tree-like structure with two classes: Tree and Node .

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.