Grokking Tree Coding Patterns for Interviews

0% completed

​

BST Operations

Binary Search Trees (BSTs) provide efficient operations for searching, inserting, and deleting elements while maintaining their sorted structure. Each of these operations leverages the BST property—where the left subtree contains values smaller than the node, and the right subtree contains values greater than the node.

In this lesson, we will cover the three primary operations on BSTs:

  1. Insertion - Adding a new node while maintaining the BST structure.
  2. Searching - Finding a node in the BST efficiently.
    3

.....

.....

.....

Like the course? Get enrolled and start learning!
Rohit Bhanot

Rohit Bhanot

· 2 months ago

There is no section on BFS vs DFS, what these are, when to use which. This is critical when understanding Trees and comes up a lot in interviews.

The Trees section in general feels very shallow and rushed through which is bad considering this is one of the most asked topics in interviews with 2nd highest questions in Blind75 list.