Rename test predicates to indicate that we are operating at the tree-level, rather than the node-level

Author: dnaeon

binarytree.go

@@ -338,9 +338,9 @@ func (n *Node[T]) FindNode(predicate FindFunc[T]) (*Node[T], bool) {
 	return nil, false
 }
 
-// IsFull returns true, if the binary tree is full. A full binary tree
+// IsFullTree returns true, if the binary tree is full. A full binary tree
 // is a tree in which every node has either 0 or 2 children.
-func (n *Node[T]) IsFull() bool {
+func (n *Node[T]) IsFullTree() bool {
 	stack := deque.New[*Node[T]]()
 	stack.PushFront(n)
 
@@ -365,8 +365,8 @@ func (n *Node[T]) IsFull() bool {
 	return true
 }
 
-// IsDegenerate returns true, if each parent has only one child node.
-func (n *Node[T]) IsDegenerate() bool {
+// IsDegenerateTree returns true, if each parent has only one child node.
+func (n *Node[T]) IsDegenerateTree() bool {
 	stack := deque.New[*Node[T]]()
 	stack.PushFront(n)
 
@@ -394,10 +394,10 @@ func (n *Node[T]) IsDegenerate() bool {
 	return true
 }
 
-// IsBalanced returns true, if the tree is balanced. A balanced tree
+// IsBalancedTree returns true, if the tree is balanced. A balanced tree
 // is such a tree, for which the height of the left and right
 // sub-trees of each node differ by no more than 1.
-func (n *Node[T]) IsBalanced() bool {
+func (n *Node[T]) IsBalancedTree() bool {
 	if n.Left == nil && n.Right == nil {
 		return true
 	}

binarytree_test.go

@@ -299,7 +299,7 @@ func TestIsFullTree(t *testing.T) {
 	two.InsertLeft(4)
 	two.InsertRight(5)
 
-	if !root.IsFull() {
+	if !root.IsFullTree() {
 		t.Fatal("tree should be full")
 	}
 }
@@ -318,12 +318,12 @@ func TestIsNotFullTree(t *testing.T) {
 	two.InsertLeft(4)
 	two.InsertRight(5)
 
-	if root.IsFull() {
+	if root.IsFullTree() {
 		t.Fatal("tree should not be full")
 	}
 }
 
-func TestTreeIsDegenerate(t *testing.T) {
+func TestTreeIsDegenerateTree(t *testing.T) {
 	// Our test tree
 	//
 	//     1
@@ -339,7 +339,7 @@ func TestTreeIsDegenerate(t *testing.T) {
 	three := two.InsertRight(3)
 	three.InsertLeft(4)
 
-	if !root.IsDegenerate() {
+	if !root.IsDegenerateTree() {
 		t.Fatal("tree should be degenerate")
 	}
 }
@@ -358,12 +358,12 @@ func TestTreeIsNotDegenerate(t *testing.T) {
 	two.InsertLeft(4)
 	two.InsertRight(5)
 
-	if root.IsDegenerate() {
+	if root.IsDegenerateTree() {
 		t.Fatal("tree should not be degenerate")
 	}
 }
 
-func TestIsBalanced(t *testing.T) {
+func TestIsBalancedTree(t *testing.T) {
 	// Unbalanced tree
 	//
 	//     1
@@ -376,7 +376,7 @@ func TestIsBalanced(t *testing.T) {
 	two := unbalanced_root.InsertLeft(2)
 	two.InsertLeft(3)
 
-	if unbalanced_root.IsBalanced() {
+	if unbalanced_root.IsBalancedTree() {
 		t.Fatal("tree should not be balanced")
 	}
 
@@ -397,13 +397,13 @@ func TestIsBalanced(t *testing.T) {
 	four.InsertLeft(6)
 	four.InsertRight(7)
 
-	if unbalanced_root.IsBalanced() {
+	if unbalanced_root.IsBalancedTree() {
 		t.Fatal("tree should not be balanced")
 	}
 
 	// A single root node is a balanced tree
 	leaf := binarytree.NewNode(1)
-	if !leaf.IsBalanced() {
+	if !leaf.IsBalancedTree() {
 		t.Fatal("single leaf node should be balanced")
 	}
 
@@ -420,12 +420,12 @@ func TestIsBalanced(t *testing.T) {
 	two.InsertLeft(4)
 	two.InsertRight(5)
 
-	if unbalanced_root.IsBalanced() {
+	if unbalanced_root.IsBalancedTree() {
 		t.Fatal("tree should not be balanced")
 	}
 
 	// The sub-tree with root node (2) is balanced
-	if !two.IsBalanced() {
+	if !two.IsBalancedTree() {
 		t.Fatal("tree with root (2) should be balanced")
 	}
 
@@ -442,7 +442,7 @@ func TestIsBalanced(t *testing.T) {
 	three.InsertLeft(4)
 	three.InsertRight(5)
 
-	if !balanced_root.IsBalanced() {
+	if !balanced_root.IsBalancedTree() {
 		t.Fatal("tree should be balanced")
 	}
 }