Check If each Internal Node has exactly one children
Largest Subtree which is BST
Level of a Nth Node
Max root to leaf Path
Morris Traversal for preorder and inorder
Morris Traversal
Vertical Sum in Tree
Tree Traversal without recursion
Swapped Nodes in tree
Tree Construction from traversals
Print nodes at a distance K from root
Largest Subtree in BST
Print Ancestors of the given node
misc
Merge https://github.com/manishrocksag/stuff
Movement of files