Check if a linked list is palindrome - using a Stack

Implement a Stack (Lifo) from a Queue (Fifo)

Impl an algorithm for converting a binary tree into a doubly linked list

Impl algo for finding the longest consecutive branch in a given tree

Implement algo for determining whether a binary is balanced

Implement binary tree traversal using breadth first search approach

Implement algorithm for checking if a binary tree is a valid BST