Page 6 - Data Structures Interactive Book
P. 6
6.1.2 Applications of Queues ................................................................................. 53
6.2 Implementation of Queues ....................................................................................... 53
6.2.1 Queue Using Arrays ...................................................................................... 54
6.2.2 Queue Using Linked Lists ............................................................................ 54
6.3 Operations on Queues .............................................................................................. 55
6.3.1 Enqueue Operation ....................................................................................... 55
6.3.2 Dequeue Operation ....................................................................................... 55
6.3.3 Peek/Front Operation .................................................................................... 55
6.3.4 Checking for Empty and Full Conditions ..................................................... 55
6.4 Types of Queues ...................................................................................................... 56
6.4.1 Circular Queue ................................................................................................ 56
6.4.2 Double-Ended Queue (Deque) ........................................................................ 56
6.4.3 Priority Queue ................................................................................................. 56
6.5 Applications in Computer Science .......................................................................... 56
6.6 Limitations of Queues .............................................................................................. 57
6.7 Summary .................................................................................................................. 57
6.8 Exercise .................................................................................................................... 58
CHAPTER 7 TREES ........................................................................................................ 60
7.1 Introduction to Trees .............................................................................................. 61
7.1.1 Definition and Characteristics ........................................................................ 61
7.1.2 Terminology (Root, Node, Edge, Height, Depth) ........................................... 61
7.1.3 Comparison with Other Data Structures ......................................................... 62
7.2 Binary Trees ........................................................................................................... 62
7.2.1 Structure of Binary Trees ................................................................................ 62
7.2.2 Properties of Binary Trees .............................................................................. 63
6
