Coding Interview Questions on Binary Tree

Description

In this course, you will learn :

• Binary Tree, Binary Search Tree (BST)
• Invert a binary tree
• Lowest Common Ancestor in a binary tree and BST
• Find distance between two nodes in 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

Syllabus :

1. Introduction & Lowest Common Ancestor

• Binary Tree - Find Lowest Common Ancestor
• Binary Search Tree - Find Lowest Common Ancestor

 

2. Binary Tree / BST

• Distance between nodes
• Invert a binary tree

 

3. Tree traversals and searches

• Depth First Search - PreOrder, InOrder, PostOrder
• Breadth First Search - level order traversal

 

4. Binary Search

• Binary Search on a sorted array
• Binary Search on a nearly sorted array (not fully sorted array)

Show more