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

The Archive Base Latest Questions

Editorial Team
  • 0
Editorial Team
Asked: June 18, 20262026-06-18T02:43:34+00:00 2026-06-18T02:43:34+00:00

I have two trees (paths), defined by a node like trait Node { def

  • 0

I have two trees (paths), defined by a node like

trait Node {
  def getParent : Node
  def op(n:Node)
}

and I want to travel two nodes up until the parent is null in parallel like:

Pseudo:

def simultanousUp(/*var*/ a:Node,/*var*/ b:Node) = 
     while(a != null) {
          a.op(b); 
          a = a.getParent;
          b = if(b!=null) b.getParent else null /*or throw somthing*/;
      }

Question: is there a more elegant and/or performant way in scala to do this?

To avoid misunderstandings: its not a question about concurrent execution!

  • 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-18T02:43:35+00:00Added an answer on June 18, 2026 at 2:43 am
    @annotation.tailrec final def simultaneousUp(a: Node, b: Node) {
      if (a != null && b != null) {
        a op b
        simultaneousUp(a.getParent, b.getParent)
      }
      // Throw exception or whatever on mismatched lengths?
    }
    
    • 0
    • Reply
    • Share
      Share
      • Share on Facebook
      • Share on Twitter
      • Share on LinkedIn
      • Share on WhatsApp
      • Report

Sidebar

Related Questions

I have two large source trees. One of them has some out of date
I have a merge function which takes time O(log n) to combine two trees
I have two tree, which contains nodes, after I've created them, I take all
I have two TFS branches that do not have a direct parent/child relationship in
I have two app domains, one parent creating the child domain. In the child
I have two machines: remote and local . I want remote to be my
i have two lists: mylist1=[['a','1'],['a',''],['a','1'],['a','3'],['b','2'],['c','2'],['c','3'],['c',''],['c','2']] and mylist2=[['a','1','lemon'],['a','2','coconut'],['a','3','chocolate'],['a','4','watermelon'],['b','1','mango'],['b','2','apple'],['b','3','tree'],['b','4','apple'],['c','1','water'],['c','2','fire'],['c','3','mountain']] I want to find out those lists
I'm trying to create an expression tree dynamicly. Let asume that I have two
I will be short, what i have is array=( one.a two.b tree.c four.b five_b_abc)
I have a tree table with two columns on a page. The first one

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.