binary tree - definizione. Che cos'è binary tree
Diclib.com
Dizionario ChatGPT
Inserisci una parola o una frase in qualsiasi lingua 👆
Lingua:

Traduzione e analisi delle parole tramite l'intelligenza artificiale ChatGPT

In questa pagina puoi ottenere un'analisi dettagliata di una parola o frase, prodotta utilizzando la migliore tecnologia di intelligenza artificiale fino ad oggi:

  • come viene usata la parola
  • frequenza di utilizzo
  • è usato più spesso nel discorso orale o scritto
  • opzioni di traduzione delle parole
  • esempi di utilizzo (varie frasi con traduzione)
  • etimologia

Cosa (chi) è binary tree - definizione

TREE DATA STRUCTURE IN WHICH EACH NODE HAS AT MOST TWO CHILDREN
Types of binary trees; Full binary tree; Complete binary tree; Binary Tree; Binary trees; Proper binary tree; Extended binary tree; Stack tree; Dyadic tree; Full tree; Perfect binary tree; Complete Binary Tree; Binary tree (graph theory); Binary tree (data structure); Deletion in binary tree; Rooted binary tree; Bifurcating arborescence; Left child; Right child
  • self-balancing binary trees]].
  • A labeled binary tree of size 9 and height 3, with a root node whose value is 1. The above tree is unbalanced and not sorted.
  • A complete binary tree (that is not full)
  • The process of deleting an internal node in a binary tree
  • A full binary tree
  • The process of inserting a node into a binary tree
  • An [[ancestry chart]] which can be mapped to a perfect 4-level binary tree.

binary tree         
¦ noun Computing a data structure in which each record is linked to two successor records.
binary tree         
(btree) A tree in which each node has at most two successors or child nodes. In Haskell this could be represented as data BTree a = NilTree | Node a (BTree a) (BTree a) See also balanced tree. (1994-11-29)
Binary tree         
In computer science, a binary tree is a tree data structure in which each node has at most two children, which are referred to as the and the . A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root.

Wikipedia

Binary tree

In computer science, a binary tree is a k-ary k = 2 {\displaystyle k=2} tree data structure in which each node has at most two children, which are referred to as the left child and the right child. A recursive definition using just set theory notions is that a (non-empty) binary tree is a tuple (L, S, R), where L and R are binary trees or the empty set and S is a singleton set containing the root. Some authors allow the binary tree to be the empty set as well.

From a graph theory perspective, binary (and K-ary) trees as defined here are arborescences. A binary tree may thus be also called a bifurcating arborescence—a term which appears in some very old programming books, before the modern computer science terminology prevailed. It is also possible to interpret a binary tree as an undirected, rather than a directed graph, in which case a binary tree is an ordered, rooted tree. Some authors use rooted binary tree instead of binary tree to emphasize the fact that the tree is rooted, but as defined above, a binary tree is always rooted. A binary tree is a special case of an ordered K-ary tree, where K is 2.

In mathematics, what is termed binary tree can vary significantly from author to author. Some use the definition commonly used in computer science, but others define it as every non-leaf having exactly two children and don't necessarily order (as left/right) the children either.

In computing, binary trees are used in two very different ways:

  • First, as a means of accessing nodes based on some value or label associated with each node. Binary trees labelled this way are used to implement binary search trees and binary heaps, and are used for efficient searching and sorting. The designation of non-root nodes as left or right child even when there is only one child present matters in some of these applications, in particular, it is significant in binary search trees. However, the arrangement of particular nodes into the tree is not part of the conceptual information. For example, in a normal binary search tree the placement of nodes depends almost entirely on the order in which they were added, and can be re-arranged (for example by balancing) without changing the meaning.
  • Second, as a representation of data with a relevant bifurcating structure. In such cases, the particular arrangement of nodes under and/or to the left or right of other nodes is part of the information (that is, changing it would change the meaning). Common examples occur with Huffman coding and cladograms. The everyday division of documents into chapters, sections, paragraphs, and so on is an analogous example with n-ary rather than binary trees.