dev hight

Edisonhuxi · Jan 8, 2019 · f8349a0 · f8349a0
1 parent 7c5c5c4
commit f8349a0
Show file tree

Hide file tree

Showing 2 changed files with 32 additions and 1 deletion.
diff --git a/scala/src/main/scala/ch24_binary_search_tree/BinarySearchTree.scala b/scala/src/main/scala/ch24_binary_search_tree/BinarySearchTree.scala
@@ -128,4 +128,21 @@ class BinarySearchTree(var root: Option[Node[Int]]) extends BinaryTree[Int] {
     }
 
   }
+
+  def hight(): Int = {
+    _hight(root)
+  }
+
+  private[this] def _hight(nodeOpt: Option[Node[Int]]): Int = {
+    nodeOpt match {
+      case None => 0
+      case Some(node) => {
+        if (node.left.isEmpty && node.right.isEmpty) {
+          1
+        } else {
+          scala.math.max(_hight(node.left), _hight(node.right)) + 1
+        }
+      }
+    }
+  }
 }
diff --git a/scala/src/test/scala/ch24_binary_search_tree/BinarySearchTreeTest.scala b/scala/src/test/scala/ch24_binary_search_tree/BinarySearchTreeTest.scala
@@ -49,7 +49,21 @@ class BinarySearchTreeTest extends FlatSpec with Matchers {
     tree.delete(18)
     tree.inOrder(tree.root) should equal("1617" + nums.sorted.slice(4, nums.size).mkString(""))
     tree.delete(66)
-    tree.inOrder(tree.root) should equal("1617" + nums.sorted.slice(4, nums.size-1).mkString(""))
+    tree.inOrder(tree.root) should equal("1617" + nums.sorted.slice(4, nums.size - 1).mkString(""))
+  }
+
+  it should "calc hight of a tree -1" in {
+    val tree = new BinarySearchTree(None)
+    val nums = Array(33, 17, 50, 13, 18, 34, 58, 16, 25, 51, 66, 19, 27, 55)
+    nums.foreach(tree.insert)
+    tree.hight() should equal(5)
+  }
+
+  it should "calc hight of a tree -2" in {
+    val tree = new BinarySearchTree(None)
+    val nums = Array(33, 17, 50, 13, 18, 34, 88).sorted
+    nums.foreach(tree.insert)
+    tree.hight() should equal(7)
   }
 
 }