• Wrong document? Swap it for free
  • Written by students who passed
  • Immediately available after payment
  • Read online or as PDF
Sell
Where do you study
Your language
Document preview thumbnail
Preview 1 out of 4 pages
Class notes

CO2412 Computational Thinking Lecture 9 Notes

Document preview thumbnail
Preview 1 out of 4 pages

This document contains detailed notes from Lecture 9 of the CO2412 course on Computational Thinking. The lecture provides an in-depth exploration of Binary Search Trees (BSTs) and Heaps, two fundamental data structures in computer science.

Content preview

CO2412: Computational Thinking
Lecture 9

Introduction to Binary Search Trees (BST)
1. Binary Tree Structure
o A Binary Tree is a hierarchical structure where each node has a
maximum of two children: a left child and a right child.
o Key Components:

 Root Node: The topmost node in the tree.
 Leaf Nodes: Nodes without children.
 Edges: Connections between nodes.
Binary Search Trees (BST)
1. Definition and Properties
o A Binary Search Tree is a type of binary tree where each node
follows a specific order:
 The left child’s value is less than its parent node’s value.
 The right child’s value is greater than its parent node’s value.
o This property allows for efficient searching, insertion, and deletion
operations.
2. Searching in a BST
o To find a value, start at the root and compare the value with the
node’s value:
 If the value is less, move to the left child.
 If the value is greater, move to the right child.
 Repeat this process until the value is found or the subtree is
exhausted.
Example:
To find the value 8:
 Start at the root (9), move left (6), then move right (8) to find
the value.

Document information

Study
Unknown
Uploaded on
August 20, 2024
Number of pages
4
Written in
2023/2024
Type
Class notes
Professor(s)
Amin amini
Contains
All classes
$5.38

Wrong document? Swap it for free Within 14 days of purchase and before downloading, you can choose a different document. You can simply spend the amount again.
Written by students who passed
Immediately available after payment
Read online or as PDF

Seller avatar
Reputation scores are based on the amount of documents a seller has sold for a fee and the reviews they have received for those documents. There are three levels: Bronze, Silver and Gold. The better the reputation, the more your can rely on the quality of the sellers work.
BpoBpo
3.7
(73)
Sold
312
Followers
250
Items
78
Last sold
6 months ago




Why students choose Stuvia

Created by fellow students, verified by reviews

Quality you can trust: written by students who passed their tests and reviewed by others who've used these notes.

Didn't get what you expected? Choose another document

No worries! You can instantly pick a different document that better fits what you're looking for.

Pay as you like, start learning right away

No subscription, no commitments. Pay the way you're used to via credit card and download your PDF document instantly.

Student with book image

“Bought, downloaded, and aced it. It really can be that simple.”

Alisha Student

Working on your references?

Create accurate citations in APA, MLA and Harvard with our free citation generator.

Working on your references?

Frequently asked questions