Important Coding Interview Questions - Part 1 (Binary Tree)

The questions included in part 1 of this series are based on topics such as - Binary Tree, Binary Search Tree (BST), Lowest Common Ancestor in a binary tree and BST,  Find distance between two nodes in a binary tree, Invert a binary tree, Depth First Search (DFS), Tree traversals: Pre-order, In-order, Post-order, Breadth First Search (BFS), Binary Search, Binary Search on a nearly sorted array (not fully sorted), Balanced brackets.