Data Structures and Algorithm
(CC-2042)
Lecture 19
E N G R. D R B I L A L A S H FA Q A H M E D
S C H O O L O F S Y S T E M S A N D T E C H N O LO GY ( S S T )
C O M P U T E R S C I E N C E FA C U LT Y
,Binary Tree
Binary Tree is a non-linear and hierarchical
data structure where each node has at most
two children referred to as the left child and
the right child. The topmost node in a binary
tree is called the root, and the bottom-most
nodes are called leaves.
09/06/2025 DS
, Arrays are fast when you want to access an element
directly, like element number 700 in an array of 1000
elements for example. But inserting and deleting
elements require other elements to shift in memory to
make place for the new element, or to take the
deleted elements place, and that is time consuming.
Binary
Trees vs
Linked Lists are fast when inserting or deleting nodes,
no memory shifting needed, but to access an element
Arrays
and
inside the list, the list must be traversed, and that
takes time.
Linked
Binary Trees, such as Binary Search Trees and AVL
Trees, are great compared to Arrays and Linked Lists
because they are BOTH fast at accessing a node, AND
Lists
fast when it comes to deleting or inserting a node,
with no shifts in memory needed.
09/06/2025 DS
(CC-2042)
Lecture 19
E N G R. D R B I L A L A S H FA Q A H M E D
S C H O O L O F S Y S T E M S A N D T E C H N O LO GY ( S S T )
C O M P U T E R S C I E N C E FA C U LT Y
,Binary Tree
Binary Tree is a non-linear and hierarchical
data structure where each node has at most
two children referred to as the left child and
the right child. The topmost node in a binary
tree is called the root, and the bottom-most
nodes are called leaves.
09/06/2025 DS
, Arrays are fast when you want to access an element
directly, like element number 700 in an array of 1000
elements for example. But inserting and deleting
elements require other elements to shift in memory to
make place for the new element, or to take the
deleted elements place, and that is time consuming.
Binary
Trees vs
Linked Lists are fast when inserting or deleting nodes,
no memory shifting needed, but to access an element
Arrays
and
inside the list, the list must be traversed, and that
takes time.
Linked
Binary Trees, such as Binary Search Trees and AVL
Trees, are great compared to Arrays and Linked Lists
because they are BOTH fast at accessing a node, AND
Lists
fast when it comes to deleting or inserting a node,
with no shifts in memory needed.
09/06/2025 DS
