Scribd Logo
Fazer o upload

Bem-vindo(a) ao Scribd!

  • 2-3 Tree: Navigation Search Computer Science Data Structure Tree Node Internal Node Data Element Leaf Nodes

    Enviado por

    Jose Ramon Sandoval Jimenez
    14 visualizações1 página
    A 2-3 tree is a type of data structure where every internal node has either two children and one data element (2-node), or three children and two data elements (3-node). Leaf nodes have no children and one or two data elements. 2-3 trees are balanced, with each subtree containing the same or close to the same amount of data, and are equivalent to AA trees, meaning the same data can be represented in either structure.

    Descrição original:

    Título original

    Arbol 2

    Direitos autorais

    © Attribution Non-Commercial (BY-NC)

    Formatos disponíveis

    DOC, PDF, TXT ou leia online no Scribd

    Você considera este documento útil?

    Este conteúdo é inapropriado?

    Denunciar este documento
    A 2-3 tree is a type of data structure where every internal node has either two children and one data element (2-node), or three children and two data elements (3-node). Leaf nodes have no children and one or two data elements. 2-3 trees are balanced, with each subtree containing the same or close to the same amount of data, and are equivalent to AA trees, meaning the same data can be represented in either structure.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato DOC, PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    14 visualizações1 página

    2-3 Tree: Navigation Search Computer Science Data Structure Tree Node Internal Node Data Element Leaf Nodes

    Enviado por

    Jose Ramon Sandoval Jimenez
    A 2-3 tree is a type of data structure where every internal node has either two children and one data element (2-node), or three children and two data elements (3-node). Leaf nodes have no children and one or two data elements. 2-3 trees are balanced, with each subtree containing the same or close to the same amount of data, and are equivalent to AA trees, meaning the same data can be represented in either structure.

    Direitos autorais:

    Attribution Non-Commercial (BY-NC)
    Baixe no formato DOC, PDF, TXT ou leia online no Scribd
    Sinalizar o conteúdo como inadequado
    de 1

    Arbol 2_3

    23 tree
    From Wikipedia, the free encyclopedia Jump to: navigation, search In computer science, a 23 tree is a type of data structure, a tree where every node with children (internal node) has either two children (2-node) and one data element or three children (3-nodes) and two data elements. Nodes on the outside of the tree (leaf nodes) have no children and one or two data elements.[1][2]

    2 node

    3 node 23 trees are an isometry of AA trees, meaning that they are equivalent data structures. In other words, for every 23 tree, there exists at least one AA tree with data elements in the same order. 23 trees are balanced, meaning that each right, center, and left subtree contains the same or close to the same amount of data.

    Você também pode gostar