Skip to main content

Courses About Pricing Educators

Sign in Get started

Courses About Pricing Educators

Get started Sign in

Loading courses

Loading lessons

Trees: Data Structures and Algorithms: Uncharted

Courses Data Structures and AlgorithmsTrees

TreesPro

Model hierarchy, traverse every branch, and use ordered trees with honest balance costs.

Data Structures and Algorithms
Unit 9 of 16
20 lessons
128 min
420 XP

This unit is part of Pro. Upgrade to open every lesson in it.

Lessons

20 total

1Families and FoldersIdentify roots, parents, children, leaves, ancestry, and depth from tree relationships.ProInteractiveConcept6 min20 XPOpen
2Node with ChildrenApply recursive child traversal to building a small folder tree and counting every node recursively.ProCodeConcept6 min20 XPOpen
3Height and DepthApply recursive maximum-child height to measuring the longest child path from a folder to a leaf.ProCodeConcept6 min20 XPOpen
4Walk PreorderApply root-before-children preorder traversal to listing each folder before the folders nested inside it.ProCodeConcept6 min20 XPOpen
5Three WalksApply preorder inorder and postorder traversal to comparing root-first, middle-root, and root-last walks over one binary tree.ProCodeConcept6 min20 XPOpen
6Predict the OrderProduce preorder, inorder, or postorder sequences by applying the visit rule at its exact moment.ProInteractiveConcept6 min20 XPOpen
7Level by LevelApply queue-driven level-order traversal to printing a folder hierarchy one queue-managed depth at a time.ProCodeConcept6 min20 XPOpen
8Draw the TreeRepresent the specified hierarchy with one root, one parent per nonroot node, and no cycles.ProDiagramConcept6 min20 XPOpen
9The Sorted TreeApply binary-search-tree insertion to inserting values so every smaller key goes left and every larger key goes right.ProCodeConcept6 min20 XPOpen
10BST SearchApply ordered binary-search-tree descent to following one comparison path through a bushy search tree.ProCodeConcept6 min20 XPOpen
11Inorder Is SortedApply inorder binary-search-tree proof to proving the binary-search-tree order with an inorder traversal.ProCodeConcept6 min20 XPOpen
12Min and Max WalksApply leftmost and rightmost BST descent to descending left for the minimum and right for the maximum.ProCodeConcept6 min20 XPOpen
13Validate the BSTApply range-passing BST validation to repairing a children-only check by passing the full legal range down the tree.ProCodeConcept6 min20 XPOpen
14Predict the BSTPredict BST shape by inserting values in order without assuming automatic rebalancing.ProInteractiveConcept6 min20 XPOpen
15The Lopsided TreeApply sorted-insert chain measurement to inserting sorted values into a chain and counting the full search path.ProCodeConcept6 min20 XPOpen
16Balance MattersRelate a search tree's longest root-to-leaf path to balanced and degenerate operation costs.ProInteractiveConcept6 min20 XPOpen
17Lowest Shared ManagerApply BST split-point ancestor search to finding the first manager whose ordered range contains both employees.ProCodePractice8 min20 XPOpen
18Tree to OutlineApply depth-tracked preorder outline to printing a folder outline with indentation tied to depth.ProCodePractice8 min20 XPOpen
19Trees EverywhereModel a hierarchy as a tree by defining its node type, root, and parent-child edge.ProInteractiveConcept6 min20 XPOpen
20Trees Mastery CheckApply BST build traversal search and height synthesis to building, traversing, measuring, and searching one binary search tree.ProCodeMastery check10 min40 XPOpen

Binary Search Heaps and Priority Queues