DocsOf
Us
Templates
How It Works
Features
PDF Editor
☕ Buy Me a Coffee
💳 PayPal Donate
Get Started
Job & Career Documents
Resume / CV
Cover Letter
Certificate of Employment
Job Offer Letter
Employment Contract
Internship Certificate
Recommendation Letter
Resignation Letter
Performance Evaluation Form
Business & Finance
Invoice
Receipt
Quotation
Purchase Order
Billing Statement
Expense Report
Sales Report
Financial Statement
Payslip
Business Proposal
Letter of Intent
Funnel Onboarding Form
Legal & Formal Letters
Contract Agreement
Non-Disclosure Agreement (NDA)
Rental Agreement
Affidavit
Authorization Letter
Demand Letter
Promissory Note
Memorandum of Agreement (MOA)
Partnership Agreement
Complaint Letter
Education & Personal Use
Certificate of Attendance
Training Certificate
Transcript Template
Study Notes / Reviewer
Ebook / Guide
Daily Planner
Weekly Planner
Event Ticket
ID Card Template
Leave Application (Sick / Vacation)
PDF Generator
Study Notes / Reviewer
Create formatted study notes and reviewer sheets with organized sections for any subject.
Header
Sections
Settings
Subject
Topic
Prepared By
Prepared Date
Sections
Add Sections
#1
Remove
Section Title
Content
A binary tree is a tree data structure in which each node has at most two children, referred to as the left child and the right child. Key properties: • Height: The length of the longest path from root to leaf • Complete Binary Tree: All levels filled except possibly the last • Full Binary Tree: Every node has 0 or 2 children Traversal methods: In-order (Left-Root-Right), Pre-order (Root-Left-Right), Post-order (Left-Right-Root)
#2
Remove
Section Title
Content
A BST is a binary tree where: • Left subtree contains only nodes with keys less than the node's key • Right subtree contains only nodes with keys greater than the node's key Operations: • Search: O(h) where h = height • Insert: O(h) • Delete: O(h) For a balanced BST: h = O(log n)
#3
Remove
Section Title
Content
Breadth-First Search (BFS): • Uses a queue data structure • Visits all neighbors at current depth before moving deeper • Time: O(V + E), Space: O(V) Depth-First Search (DFS): • Uses a stack (or recursion) • Explores as far as possible along each branch before backtracking • Time: O(V + E), Space: O(V)
Page Size
Select…
A4
Letter
Legal
Font Family
Select…
Times-Roman
Helvetica
Courier
Roboto
Source Sans 3
JetBrains Mono
Accent Color
Preview PDF
Reset