Rename node-level test predicates to make it clearer they operate on the node-level

Author: dnaeon

binarytree.go

@@ -287,8 +287,8 @@ func (n *Node[T]) Height() int {
 	return max_height
 }
 
-// IsLeaf returns true, if the node is a leaf, false otherwise.
-func (n *Node[T]) IsLeaf() bool {
+// IsLeafNode returns true, if the node is a leaf, false otherwise.
+func (n *Node[T]) IsLeafNode() bool {
 	return n.Left == nil && n.Right == nil
 }
 
@@ -349,7 +349,7 @@ func (n *Node[T]) IsFullTree() bool {
 		if err != nil {
 			panic(err)
 		}
-		if node.IsLeaf() {
+		if node.IsLeafNode() {
 			continue
 		}
 
@@ -375,7 +375,7 @@ func (n *Node[T]) IsDegenerateTree() bool {
 		if err != nil {
 			panic(err)
 		}
-		if node.IsLeaf() {
+		if node.IsLeafNode() {
 			continue
 		}
 		both := node.Left != nil && node.Right != nil

binarytree_test.go

@@ -41,7 +41,7 @@ func TestHeightAndSize(t *testing.T) {
 	}
 }
 
-func TestIsLeaf(t *testing.T) {
+func TestIsLeafNode(t *testing.T) {
 	// Our test tree
 	//
 	//     __1
@@ -56,23 +56,23 @@ func TestIsLeaf(t *testing.T) {
 	four := two.InsertLeft(4)
 	five := two.InsertRight(5)
 
-	if root.IsLeaf() {
+	if root.IsLeafNode() {
 		t.Fatal("root node should not be a leaf")
 	}
 
-	if two.IsLeaf() {
+	if two.IsLeafNode() {
 		t.Fatal("node (2) should not be a leaf")
 	}
 
-	if !three.IsLeaf() {
+	if !three.IsLeafNode() {
 		t.Fatal("node (3) should be a leaf")
 	}
 
-	if !four.IsLeaf() {
+	if !four.IsLeafNode() {
 		t.Fatal("node (4) should not be a leaf")
 	}
 
-	if !five.IsLeaf() {
+	if !five.IsLeafNode() {
 		t.Fatal("node (5) should be a leaf")
 	}
 }