COMP6049 – Algorithm Design
and Analysis
Topic 5 – Analysis of Data Structures: Stack, Queue, Tree, and
Binary Tree
, Outline Materials
• Concept of ADT (abstract data type)
• Stack data structure
• Queue data structure
• Definition of tree
• Tree traversal
• Binary tree characteristics
• Operations in tree
Bina Nusantara University ISYS6197 2
, ABSTRACT DATA TYPE
• Abstract Data Type (ADT)
– ADT is an abstract concept created by humans to simplify the calculation of a
process through abstraction.
• ADT is not directly recognized by the computer's processor, but a high
level programming language can be used to implement ADT
• Example of ADT
– Stack
– Queue
– Tree
– Graph
and Analysis
Topic 5 – Analysis of Data Structures: Stack, Queue, Tree, and
Binary Tree
, Outline Materials
• Concept of ADT (abstract data type)
• Stack data structure
• Queue data structure
• Definition of tree
• Tree traversal
• Binary tree characteristics
• Operations in tree
Bina Nusantara University ISYS6197 2
, ABSTRACT DATA TYPE
• Abstract Data Type (ADT)
– ADT is an abstract concept created by humans to simplify the calculation of a
process through abstraction.
• ADT is not directly recognized by the computer's processor, but a high
level programming language can be used to implement ADT
• Example of ADT
– Stack
– Queue
– Tree
– Graph