Tree Traversal based Questions

Post Order

http://www.geeksforgeeks.org/given-a-binary-tree-how-do-you-remove-all-the-half-nodes/

Pre Order

1. http://www.dsalgo.com/2013/03/find-deepest-nodes-of-binary-tree.html

2. http://www.geeksforgeeks.org/check-if-a-binary-tree-is-subtree-of-another-binary-tree/

http://www.geeksforgeeks.org/check-binary-tree-subtree-another-binary-tree-set-2/

3. Trim a BST

http://www.geeksforgeeks.org/remove-bst-keys-outside-the-given-range/
http://www.ardendertat.com/2012/01/17/programming-interview-questions-26-trim-binary-search-tree/

4.

In Order:

1. Pair of values in BST with sum S

http://www.geeksforgeeks.org/find-a-pair-with-given-sum-in-bst/

http://www.geeksforgeeks.org/find-if-there-is-a-triplet-in-bst-that-adds-to-0/

2. Median in a BST

https://learn.hackerearth.com/forum/354/median-of-a-bst/

3. BST to Greater Sum Tree/

http://algorithms.tutorialhorizon.com/convert-bst-to-greater-sum-tree/

4. kth smallest or largest in a BST

http://www.geeksforgeeks.org/find-k-th-smallest-element-in-bst-order-statistics-in-bst/
http://www.geeksforgeeks.org/kth-largest-element-in-bst-when-modification-to-bst-is-not-allowed/
http://www.geeksforgeeks.org/kth-smallest-element-in-bst-using-o1-extra-space/

Level Order:

1. http://www.geeksforgeeks.org/find-minimum-depth-of-a-binary-tree/

2.http://www.geeksforgeeks.org/check-if-a-given-binary-tree-is-complete-tree-or-not/
http://www.geeksforgeeks.org/check-whether-binary-tree-complete-not-set-2-recursive-solution/

3.http://www.geeksforgeeks.org/print-cousins-of-a-given-node-in-binary-tree/

4.