DSC 651

STRUCTURES OF DATA
PRESENTATION:
HIERARCHICAL
-TREES
GROUP A CLASS:
1. NUR ALIN FATHIRAH
D1CS2496A
2. ALIA NUR IZZAH
3. NUR NABILA SOFEA
4. HASYA SYARAFANA
5. NURUL ANIS
6. NURNAIM
 DATA
01 STRUCTURE
Presented by Nurnaim Binti Yahya (2020968581)
 DATA STRUCTURE
A data structure in computer science is a system used to store data, keep it
organized, and enable easy modification and accessed. Remember it this way:

• Programs= algorithms + data structures

• Data structures=related data + allowed operations on that data

In other words, effective and efficient programs all start with solid data
structures. In fact, data structures are likely the most fundamental and
building-block subject in computer science.

Why is data structure is important?

 02
EXAMPLES OF
DATA
STRUCTURES
Presented by: NUR NABILA SOFEA
BINTI MAT ZIZI (2020977161)
 LINKED LISTS

A linear data structure

Linked list is a sequence of elements where each element is linked to the next

Linked lists can contain anything including strings, characters, or numbers

Advantage of linked lists : can insert and delete elements to the beginning of the list in
constant time
 STACK

Stacks work on the Last In First Out (LIFO) method

The last one you place on top of the stack is the first one you can remove

Undo function on your computer, is the example of stack data structure

 HASH TABLES

 A data structure that can be implemented as a linear or non-linear

data structure

Hash tables are used to map keys to values and usually built using arrays

Example, If you had a list of names, a hash table might be used to identify a person’s phone
number using their name
 03
HIERARCHICAL:
TREES
Presented by: HASYA SYARAFANA BT MOHD ZAIDI (2020964149)
 DEFINITION
HIERARCHICAL DATA
BEGINS WITH A ROOT
IS SHOWN IN TREE
ENTITY
01 GRAPH
• It is because of their similarity to 02 • Example: CEO of a company, the name
of a book, the title of a folder. etc.
a tree’s structure.
• Root entity has at least one “child node”
• An upside down tree where the
and every child node has zero or more
root is on top and the branches
children.
below it.

CONT. TREE DIAGRAM:

03 • Entity that comes after another
entity is a child node of the
entity above.
• An entity above another entity
is a parent node to its below
entity.
04 • the term “tree diagram”
was created by Noam
Chomsky in his 1965
work which is the Theory
of Syntax.
 04
TREE DIAGRAM
USED
Presented by : NUR ALIN FATHIRAH
BINTI MAZLAN (2020980545)
TREE DIAGRAM ARE FREQUENTLY
FAMILY
USED:
TAXOMONY
LINEAGE
To demonstrate family The technique and science of
connections and categorization
descent. in taxonomy.

SCIENCE SUBJECT
To demonstrate the
In computer science and
origin of species in
mathematics
evolutionary science.

BUSINESS
For managerial purposes in
corporations and
organisations.
 EXAMPLE
05 OF TREE
DIAGRAM
Presented by: NURUL ANIS BINTI ABDUL
SATAR
 06
TYPE OF
TREE
DIAGRAM
Presented by: ALIA NUR IZZAH BINTI ZULKIFLI
(2020957747)
Enable the representation of hierarchies with large
multiples of nodes
Begin with a root node and arrange all the child
nodes of that root equidistant from the parent
 THE TREEMAP
DIAGRAM
Represent hierarchies by using all the available space
and in the form of nested rectangles
Extremely useful for comparing nodes and identifying
patterns within them
 THE BOTANICAL TREE
DIAGRAM
The limitation of tree diagrams was that they can
quickly become too complex to be functional
Extend the concept of tree diagrams by adding
leaves and branches
 TOOLS TO GENERATE
07 VISUALIZATION FOR
TREE
Presented by: NURUL ANIS BINTI ABDUL
SATAR
• Google charts (code)

• Datamatic

• Gliffy

• JSCharting

• Vizzlo

• Zoomcharts