This document contains detailed notes from Lecture 18 of the CO2412 course on Computational Thinking, focusing on key data structures and algorithms essential for exam preparation. The lecture provides an in-depth review of Binary Trees, Binary Search Trees (BSTs), Heaps, and Graph Theory, along wi...
Binary Trees
1. Definition and Structure
o A Binary Tree is a data structure where each node has at most two
children referred to as the left child and the right child.
2. Key Characteristics
o Nodes in a binary tree can have 0, 1, or 2 children.
o The binary tree is used in various algorithms due to its efficiency in
searching and sorting operations.
Binary Search Trees (BST)
1. What is a Binary Search Tree?
o A Binary Search Tree (BST) is a sorted binary tree where each
node's left subtree contains only nodes with values less than the
node's value, and the right subtree contains only nodes with values
greater than the node's value.
2. Properties of a BST
o A BST is sorted by key, allowing efficient searching, insertion, and
deletion operations.
o The left child is less than the parent key, and the right child is
greater.
Full Binary Tree
1. Definition
o A Full Binary Tree is one in which every node has either 0 or 2
children. The height of a full binary tree is log(n), where n is the
number of nodes.
2. Level Properties
o Each level in a full binary tree has double the number of nodes
compared to the previous level.
The benefits of buying summaries with Stuvia:
Guaranteed quality through customer reviews
Stuvia customers have reviewed more than 700,000 summaries. This how you know that you are buying the best documents.
Quick and easy check-out
You can quickly pay through credit card or Stuvia-credit for the summaries. There is no membership needed.
Focus on what matters
Your fellow students write the study notes themselves, which is why the documents are always reliable and up-to-date. This ensures you quickly get to the core!
Frequently asked questions
What do I get when I buy this document?
You get a PDF, available immediately after your purchase. The purchased document is accessible anytime, anywhere and indefinitely through your profile.
Satisfaction guarantee: how does it work?
Our satisfaction guarantee ensures that you always find a study document that suits you well. You fill out a form, and our customer service team takes care of the rest.
Who am I buying these notes from?
Stuvia is a marketplace, so you are not buying this document from us, but from seller BpoBpo. Stuvia facilitates payment to the seller.
Will I be stuck with a subscription?
No, you only buy these notes for $4.50. You're not tied to anything after your purchase.
