BTree Example

container/gtree/gtree_btree.go

@@ -346,15 +346,21 @@ func (tree *BTree) Left() *BTreeEntry {
 	tree.mu.RLock()
 	defer tree.mu.RUnlock()
 	node := tree.left(tree.root)
-	return node.Entries[0]
+	if node != nil {
+		return node.Entries[0]
+	}
+	return nil
 }
 
 // Right returns the right-most (max) entry or nil if tree is empty.
 func (tree *BTree) Right() *BTreeEntry {
 	tree.mu.RLock()
 	defer tree.mu.RUnlock()
 	node := tree.right(tree.root)
-	return node.Entries[len(node.Entries)-1]
+	if node != nil {
+		return node.Entries[len(node.Entries)-1]
+	}
+	return nil
 }
 
 // String returns a string representation of container (for debugging purposes)
@@ -931,7 +937,7 @@ func (tree *BTree) deleteChild(node *BTreeNode, index int) {
 
 // MarshalJSON implements the interface MarshalJSON for json.Marshal.
 func (tree *BTree) MarshalJSON() ([]byte, error) {
-	return json.Marshal(tree.Map())
+	return json.Marshal(tree.MapStrAny())
 }
 
 // getComparator returns the comparator if it's previously set,

container/gtree/gtree_z_example_avltree_test.go

@@ -0,0 +1,7 @@
+// Copyright GoFrame Author(https://goframe.org). All Rights Reserved.
+//
+// This Source Code Form is subject to the terms of the MIT License.
+// If a copy of the MIT was not distributed with gm file,
+// You can obtain one at https://github.com/gogf/gf.
+
+package gtree_test