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

BST

Sumit Rawal answered on August 20, 2021 Popularity 1/10 Helpfulness 1/10

answer BST

related What is bst

BST

Comment

class BST() {
  class Node(var start: Int, var end: Int) {
    var leftChild: Node = null
    var rightChild: Node = null
  }

  var root: Node = null

  def insert(start: Int, end: Int): Boolean = {
    if (this.root == null) {
      root = new Node(start, end)
      return true
    }
    val newNode = new Node(start, end)
    addNode(this.root, newNode)
  }

  def addNode(currentNode: Node, newNode: Node): Boolean = if (newNode.start >= currentNode.end) {
    if (currentNode.rightChild == null) {
      currentNode.rightChild = newNode
      return true
    }
    addNode(currentNode.rightChild, newNode)
  }
  else if (newNode.end <= currentNode.start) {
    if (currentNode.leftChild == null) {
      currentNode.leftChild = newNode
      return true
    }
    addNode(currentNode.leftChild, newNode)
  }
  else false
}

Popularity 1/10 Helpfulness 1/10 Language scala

Source: Grepper

Tags: scala

Link to this answer
Share Copy Link

Contributed on May 24 2023

Sumit Rawal

0 Answers Avg Quality 2/10

Closely Related Answers

What is bst

Comment

All nodes of left subtree are lesser than root.
All nodes of right subtree are greater that root.
No duplicate nodes

Popularity 10/10 Helpfulness 3/10 Language whatever

Source: Grepper

Tags: whatever whateve

Link to this answer
Share Copy Link

Contributed on Aug 20 2021

Important Ibex

0 Answers Avg Quality 2/10

BST

Contents

More Related Answers

BST

Closely Related Answers

What is bst

Grepper

Documentation

Social

Legal

Contact

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