Main Navigation
Share your interview in your own words — our AI handles the rest. Hardly takes 2 minutes.
Practice mock interviews or book a 1:1 call for career guidance, resume reviews, and more.
Connect with us on social media
Interview experiences & questions tagged Binary Tree
Write an algorithm to check if a given binary tree is a binary search tree (BST). Discuss the necessary properties of a BST that must be validated.
Perform a Depth First Search (DFS) traversal on a binary tree. Discuss how you would implement this and handle edge cases.
Write a function to print the bottom view of a binary tree. The bottom view is defined as the nodes that are visible when the tree is viewed from below.
Given a binary tree, print the nodes that are visible when the tree is viewed from the left side. You are to return the left view as an array of node values.
Coming Soon
