Please enable JavaScript.
Coggle requires JavaScript to display documents.
TREES: USES, CHARACTERISTICS, REPRESENTATION AND
BUILDING…
TREES: USES, CHARACTERISTICS, REPRESENTATION AND
BUILDING
Simple concepts
The concept of a tree implies a data structure where they are organized in a related way through branches
They can be used to represent mathematical formulas or to properly organize the information you need
Tree-like structures are used to represent data with a hierarchical relationship between their elements
-
Nodes
Which is known as root, creating a relationship with the other elements which gives rise to terms such as father, son, brother, predecessor, successor, ancestor.
-
BINARY TREES (REPRESENTATION, TRAVEL IN PREORDEN, INORDEN, POSTORDEN)
A binary tree is a set of nodes that consist of a root node linked to two disjoint binary trees, called the left subtree and the right subtree.
Travels
In Depth Travel: The tree can be traversed in different orders, according to the moment it visits its root.
-
-
-
Travel in Width: It consists of going through the different levels and, within each level, the different nodes from left to right.
BINARY SEARCH TREES
A binary search tree is one in which, for any node, its value is greater than the values of the nodes of its left subtree and inferior to those of its right subtree.
-
-
-
-
-
-
-
-
-
-
-
-
-
-
