I'm working on some Scala problems given here . Specifically, specifically:
sealed abstract class Tree[+T]
case class Node[+T](value: T, left: Tree[T], right: Tree[T]) extends Tree[T] {
override def toString = "T(" + value.toString + " " + left.toString + " " + right.toString + ")"
}
case object End extends Tree[Nothing] {
override def toString = "."
}
object Node {
def apply[T](value: T): Node[T] = Node(value, End, End)
}
While implementing an insert into a height balanced tree I have the following function.:
def insert(node: Tree[Char], value: Char): Tree[Char] = {
if(node.eq(End)){
Node(value,End,End)
}
else{
val internalNode = node.asInstanceOf[Node[Char]]
if(internalNode.left.height == internalNode.right.height){
if(Random.nextBoolean()){ //choose left
internalNode.left = insert(internalNode.left,value)
}else{
internalNode.right = insert(internalNode.right,value)
}
}
else if(internalNode.left.height > internalNode.right.height){ //insert into right
internalNode.right = insert(internalNode.right,value)
}
else{ //insert into left
internalNode.left = insert(internalNode.left,value)
}
internalNode
}
}
Could you please let me know how I could improve this code.
isIs there a way I can avoid doing the casting in
asInstanceOf
?howHow can I improve the if else
if
else
checks?
General feedback is also much appreciated.
Thank you