Zero To DSAZero To DSA
Privacy Policy路FAQ路Report a Bug路Support on Ko鈥慺i
Learning Path
Introduction to DSABig O & ComplexityArrays & StringsHashMaps & SetsLinked ListsStacks & QueuesRecursion & BacktrackingSearching & SortingTrees & TriesGreedy & IntervalsGraphsDynamic Programming

Trees & Tries

5 practice problems

Learn
Practice
Exam
Maximum Depth of Binary Tree
easy
Binary Tree Inorder Traversal
easy
Validate Binary Search Tree
medium
Lowest Common Ancestor of BST
medium
Serialize and Deserialize Binary Tree
hard