Fase 4-Diseño de Arboles Binario

Download as docx, pdf, or txt
Download as docx, pdf, or txt
You are on page 1of 6

Fase 4 Diseño de Arboles Binarios

Estructura de Datos

Yulieth Valentina Suarez Albarracin

301305_103

Tutor

Rolando Fabian Juanco

UNIVERSIDAD NACIONAL ABIERTA Y A DISTANCIA - UNAD


ESCUELA DE CIENCIAS BÁSICAS TECNOLOGÍA E INGENIERA - ECBTI
BOGOTA
2023
Introduction

Trees are a fundamental data structure in computer science. They are used to
represent hierarchical data, such as the file system on a computer or the family tree
of a person.

There are many different types of trees, but one of the most common is the
binary tree. A binary tree is a tree in which each node has at most two children.

Binary trees are often used to store data in a sorted order. This is because it
is easy to search for a value in a binary tree.

In this paper, we will discuss the basics of binary trees. We will cover topics
such as the definition of a binary tree, the different types of binary trees, and the
operations that can be performed on binary trees.
Objectives

-Implement the operations of insertion, search, and traversal of binary trees.

-Design a graphical user interface for a binary tree.

-Implement the graphical user interface in an object-oriented programming


language.
Link de la carpeta: Fase4ArbolesBinarios
Conclusions

This activity is a valuable opportunity for me to apply my knowledge of


hierarchical structures in a practical setting. The activity will help me to develop my
skills in data structures, object-oriented programming, and problem-solving.

Through this activity, I will be able to demonstrate my understanding of the


fundamentals of hierarchical structures, including different types of binary trees,
their classification, and how to traverse them. I will also be able to design and
implement graphical user interfaces of binary trees coded in an object-oriented
programming language.
Bibliographic References

Martínez, R., & Quiroga, E. (2002). Estructuras Jerárquicas Y Árboles


Binarios De Búsqueda. In Estructuras de datos. Referencia práctica con orientación
a objetos (pp. 115-136). https://go-gale-com.bibliotecavirtual.unad.edu.co/ps/i.do?
p=GVRL&u=unad&id=GALE|
CX3003600014&v=2.1&it=r&sid=GVRL&asid=e9e1c2f1

Villalpando Becerra, J. (2015). Matemáticas discretas. Aplicaciones y


ejercicios. Árboles. (pp. 241-
271). https://elibro-net.bibliotecavirtual.unad.edu.co/es/ereader/unad/39454

You might also like