Binary Tree Bootcamp

Table of Contents:

A Quick Message 0:00 - 0:31
What We Are Going To Do 0:31 - 0:52
Full Binary Trees 0:52 - 1:38
Complete Binary Trees 1:38 - 2:14
Perfect Binary Trees 2:14 - 3:18
Let's Discuss The 2 Fundamental Traversals 3:18 - 3:42
How To Know Which Traversal Is Which 3:42 - 5:05
Think of Recursion Like This. 5:05 - 5:33
Preorder Traversal Walkthrough 5:33 - 11:15
Inorder Traversal Walkthrough 11:15 - 14:25
We Realize That This Is A Special Tree 14:25 - 15:07
Postorder Traversal Walkthrough 15:07 - 18:59
Briefly Addressing Time Complexity 18:59 - 19:22
Wrap Up 19:22 - 19:40

Notes:

At 1:42 I meant that binary heaps are complete binary trees with the heap ordering property. Not that a complete binary tree is always a heap.

Code: https://github.com/bephrem1/backtobackswe/blob/master/Trees%2C%20Binary%20Trees%2C%20%26%20Binary%20Search%20Trees/FundamentalTraversals/FundamentalTraversals.java
Reference: https://en.wikipedia.org/wiki/Binary_tree#Types_of_binary_trees

Discussion

10 comments