## Inorder Tree Traversal without Recursion: GeeksforGeeks

Problem Statement:
It is easy to traverse a binary tree in-order using recursion. Do it without using recursion.

## Lowest Common Ancestor in a BST: GeeksforGeeks

Problem Statement:
Given values of two nodes in a Binary Search Tree, write a c program to find the Lowest Common Ancestor (LCA). You may assume that both the values exist in the tree. You can assume that the nodes are present in the tree.

## Check for Same BSTs from Arrays: GeeksforGeeks

Problem Statement:
Given two arrays which represent a sequence of keys. Imagine we make a Binary Search Tree (BST) from each array. We need to tell whether two BSTs will be identical or not without actually constructing the tree.
For example, the input arrays are {2, 4, 3, 1} and {2, 1, 4, 3} will construct the same tree

## Extract Leaves of a Binary Tree in a Doubly Linked List : GeeksforGeeks

Problem Statement:
Given a Binary Tree, extract all leaves of it in a Doubly Linked List (DLL). Note that the DLL need to be created in-place. Assume that the node structure of DLL and Binary Tree is same, only the meaning of left and right pointers are different. In DLL, left means previous pointer and right means next pointer.