Checkpoint: binary search trees · DSA University

LearningRoadmap Learn Practice LabNEW Assessments Plan Progress

CompeteContests Leaderboard

CommunityDiscuss Live classesLIVE Messages8

YouLibrary Profile Settings Help & support

Weekly goal9/12

3 problems behind pace

47 lvl14 rating1,684↑42

Loading

Learn/Trees & Traversal

Question 1 of 3

A node's value is greater than its parent's, and the node is a left child. What can you conclude?

Up next in this course

What a tree actually is8:12 The four traversals, animated11:40 Doing it without recursion9:55 Traversal cheat sheet6 min read Checkpoint: traversal orders8 questions The BST invariant10:20 Bounds, not parents7:35 Searching and descending12:08 When a BST degrades9 min read Checkpoint: binary search trees10 questions

Rebuilding from traversals13:45

Serialisation formats10:02

Practice this

The problems that drill exactly what this lesson covers.

098 · Validate BST 235 · LCA of a BST