Breaking News: Grepper is joining You.com. Read the official announcement!

Feature #2: Locating Stock Data

Add Answer

Sumit Rawal answered on May 24, 2023 Popularity 1/10 Helpfulness 1/10

answer Feature #2: Locating Stock Data

Feature #2: Locating Stock Data

Comment

Let’s see how we might implement this functionality:

First, we’ll traverse the tree starting from the root node.

Then, we’ll store the parent of each node in the dictionary until the nodes a and b are not found.

If the nodes a and b are found:

Traverse over the parents/ancestors of node a.

For each parent node, add it to the ancestors set.

Similarly, we will traverse through the ancestors of node b. If the ancestor is present in the ancestors set for a, this is the first ancestor common in between a and b (while traversing upwards), and this is the LCA node.

import scala.collection.mutable.{ArrayBuffer,ArrayDeque, HashMap, HashSet}


object Main {
  class TreeNode(var value: Int) {
    var children = new ArrayBuffer[TreeNode]
  }

  def lowestCommonAncestor(root: TreeNode, a: TreeNode, b: TreeNode): Int = {
    var stack = new ArrayDeque[TreeNode]
    var parent = new HashMap[TreeNode, TreeNode]
    parent(root) = null
    stack += root
    while ( {
      !parent.contains(a) || !parent.contains(b)
    }) {
      val node = stack.head
      stack -= node
      for (child <- node.children) {
        parent(child) = node
        stack += child
      }
    }
    var x:TreeNode = a
    var y:TreeNode = b
    val ancestors = new HashSet[TreeNode]
    while ( {
      x != null
    }) {
      ancestors += x
      x = parent(x)
    }
    // The first ancestor of b which appears in
    // a's ancestor set() is their lowest common ancestor.
    while ( {
      !ancestors.contains(y)
    }) y = parent(y)
    y.value
  }

  def main(args: Array[String]): Unit = { // Driver Code

    val root = new TreeNode(1)
    root.children += new TreeNode(2)
    root.children += new TreeNode(3)
    root.children += new TreeNode(4)
    root.children(0).children += new TreeNode(5)
    root.children(0).children(0).children+= new TreeNode(10)
    root.children(0).children += new TreeNode(6)
    root.children(0).children(1).children += new TreeNode(11)
    root.children(0).children(1).children += new TreeNode(12)
    root.children(0).children(1).children += new TreeNode(13)
    root.children(2).children += new TreeNode(7)
    root.children(2).children += new TreeNode(8)
    root.children(2).children += new TreeNode(9)
    var a = root.children(0).children(1).children(2)
    var b = root.children(0).children(0).children(0)
    var LCA = lowestCommonAncestor(root, a, b)
    println("\"" + LCA + "\"" + " is the lowest common ancestor of the nodes " + "\"" + a.value + "\"" + " and " + "\"" + b.value + "\"")

  }
}

Popularity 1/10 Helpfulness 1/10 Language scala

Source: Grepper

Tags: scala stock-data

Link to this answer
Share Copy Link

Contributed on May 24 2023

Sumit Rawal

0 Answers Avg Quality 2/10

Feature #2: Locating Stock Data

Contents

More Related Answers

Feature #2: Locating Stock Data

Grepper

Documentation

Social

Legal

Contact

Oops, You will need to install Grepper and log-in to perform this action.