Algorithm Design a Binary Search Tree Iterator Design a Binary Search Tree Iterator which allows us to retrieve the next smallest number and check if there exists the next smallest number in the BST.
Algorithm Lowest Common Ancestor of Binary Tree Lowest Common Ancestor (LCA) is a very popular question in an interview. Not only you need to understand what LCA is, you will also need to know its application as well.
Algorithm Identify a Balanced Binary Tree Given a binary tree, can you determine whether it is a height-balanced binary tree? What methods can we apply on this question? Read on to find out!
Algorithm Binary Tree Traversal: Preorder, Inorder, Postorder Getting a deeper understanding of how to traverse preorder, inorder and postorder binary tree in multiple ways.
