TREE DATA STRUCTURE

TREE DATA STRUCTURE

1. LINEAR DATA STRUCTURES

   • ARRAY, LINKED LIST, STACK, QUEUE

2. BINARY SEARCH TREE

   • Binary Search Tree es una estructura de datos de árbol binario basada en nodos que tiene las siguientes propiedades: El subárbol izquierdo de un nodo contiene solo nodos con claves menores que la clave del nodo. El subárbol derecho de un nodo solo contiene nodos con claves mayores que la clave del nodo. El subárbol izquierdo y derecho también debe ser un árbol de búsqueda binario.

3. In computer science, a tree is a widely used abstract data type (ADT)—or data structure implementing this ADT—that simulates a hierarchical tree structure, with a root value and subtrees of children with a parent node, represented as a set of linked nodes.

4. TERMINOLOGY

   • Root The top node in a tree. Child A node directly connected to another node when moving away from the root. Parent The converse notion of a child. Siblings A group of nodes with the same parent. Descendant A node reachable by repeated proceeding from parent to child. Also known as subchild. Ancestor A node reachable by repeated proceeding from child to parent. Leaf External node (not common) A node with no children. Branch node Internal node A node with at least one child. Degree For a given node, its number of children. A leaf is necessarily degree zero. Edge The connection between one node and another. Path A sequence of nodes and edges connecting a node with a descendant. Level The level of a node is defined as: 1 + the number of edges between the node and the root. Depth The depth of a node is defined as: the number of edges between the node and the root. Height of node The height of a node is the number of edges on the longest path between that node and a descendant leaf. Height