Trees and Tries

BST, traversals, LCA, Trie operations.

Log in to read this chapter

This chapter is part of Placements — DSA & Coding. Log in to continue reading the full lessons, notes and practice.

What you'll learn in this chapter

Binary Tree Traversals (DFS)

Level-Order Traversal (BFS)

Binary Search Tree Operations

Tree Properties — Height, Diameter, Balance

Lowest Common Ancestor and Path Problems

Tree Construction and Views

Trie (Prefix Tree)