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

  • Home
  • SEARCH
  • 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 7602203
In Process

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: May 30, 20262026-05-30T23:21:09+00:00 2026-05-30T23:21:09+00:00

for (Enumeration e = root.preorderEnumeration(); e.hasMoreElements() && theNode == null;) { DefaultMutableTreeNode node =

  • 0
    for (Enumeration e = root.preorderEnumeration(); e.hasMoreElements() && theNode == null;) {
        DefaultMutableTreeNode node = (DefaultMutableTreeNode) e.nextElement();

    }

For that example above, how can you find out how deep you are in the tree branch? If you are iterating over siblings, how do you get it’s index?

  • 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-30T23:21:11+00:00Added an answer on May 30, 2026 at 11:21 pm

    You can get the depth by counting the number of parents iterating on getParent() from node until result is null.

    You can get node‘s index thanks to node.getIndex(node.getParent()).

    If you need both information for each node you traverse, I recommend you for efficiency to write your own traversor code, either inspired from DefaultMutableTreeNode.getNextNode() or DefaultMutableTreeNode.PreorderEnumeration inner class. In that later case, the generated stack should contain a structure { node, treeDepth, siblingIndex }

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

Sidebar

Related Questions

Is there a way to write an enumeration that can be extended. I have
.NET supports the FlagsAttribute for enum's, which indicates that an enumeration can be treated
Since enumeration uses integers, what other structure can I use to give me enum-like
Does Perl have an enumeration type that adheres to best practices , or maybe
I have an enumeration that I am trying to initialize from a long value
I have an enumeration that I want to use in pattern matches in an
In the example enumeration code given in this question , reproduced below, why does
Microsoft reports that Enumeration member values are treated as numbers in JSON . We're
I have an enumeration that looks like the following public enum MyEnum { A,
I have an enumeration marked with a Flag attribute. How can I establish convenient

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.