当前位置：文江博客话题详情

很好的 ADT 来实现 BTREE

发布于 2024-08-09 04:52:44 字数 32 浏览 11 评论 0原文

我应该使用什么数据结构来实现 BTree？为什么？

原文

分享到QQ

分享到微博

如果你对这篇内容有疑问，欢迎到本站社区发帖提问参与讨论，获取更多帮助，或者扫码二维码加入 Web 技术交流群。

发布评论

需要登录才能够评论，你可以免费注册一个本站的账号。

故人的歌 2024-08-16 04:52:44

您可以使用以下类创建一个 btree 节点。它有 7 个键和 8 个指针。你可以根据btree节点的定义来改变它并对其进行操作

class BTNode
{
   BTNode pointers[];
   String keys[];
   int numKeys;
   boolean leaf;

   public BTNode()  // constructor to initialize values
   {
     leaf=true;
     numKeys=0;
     keys=new String[7];
     pointers=new BTNode[8];
   }
}

You can create a btree node using following class.. it is having 7 keys and 8 pointers. u can change it according to the definition of btree node and perform operations on it

class BTNode
{
   BTNode pointers[];
   String keys[];
   int numKeys;
   boolean leaf;

   public BTNode()  // constructor to initialize values
   {
     leaf=true;
     numKeys=0;
     keys=new String[7];
     pointers=new BTNode[8];
   }
}

回复收藏 0 原文

喜爱皱眉﹌ 2024-08-16 04:52:44

class Node {
   int data;
   Node left;
   Node right;
}

class BNode {
   Node[] nodes;
}

这样，您将拥有指向 BNode 的每个节点的指针，以指向左右子树......

class Node {
   int data;
   Node left;
   Node right;
}

class BNode {
   Node[] nodes;
}

This way you will have pointers to every node of the BNode to point to the right and left subtree....

回复收藏 0 原文

永言不败 2024-08-16 04:52:44

几天前我用LinkedList实现了BTree（删除O(1)，插入O(1)）。我会告诉你我的代码。这是我的 BNode 结构：

public class BTree {
    private int order;
    private BNode root;


    public BTree(int order) {
        this.order = order;
    }

    public void insert(int value){}
    public boolean delete(int value){}
    public boolean contains(int value){}
    public void print(){}

}

class BNode{
    private LinkedList<Integer> values;
    private LinkedList<BNode> children;

    public BNode(){
        init(values);
        init(children); // every bnode with order k has k+1 children 
    }


}

I implemented BTree in a few days ago with LinkedList (delete O(1), insert O(1)). I will show you my code. Here is my BNode structure:

public class BTree {
    private int order;
    private BNode root;


    public BTree(int order) {
        this.order = order;
    }

    public void insert(int value){}
    public boolean delete(int value){}
    public boolean contains(int value){}
    public void print(){}

}

class BNode{
    private LinkedList<Integer> values;
    private LinkedList<BNode> children;

    public BNode(){
        init(values);
        init(children); // every bnode with order k has k+1 children 
    }


}

回复收藏 0 原文

~没有更多了~