-
Notifications
You must be signed in to change notification settings - Fork 4
Home
Suyash Soni edited this page Dec 13, 2017
·
15 revisions
- Path(s) from root to leaves
- Convert a unbalanced BST to balanced BST
- Consruct a BST from given sorted array
- Children sum property - For each node, node's data equals to sum left & right child's data
- Distance between 2 arbitrary nodes
- Distance between root & any arbitrary node
- Inorder successor & predecessor
- To check whether binary is balanced
- Path with sum equals to given sum
- Left & right view of binary tree
- LCA - Lowest Common Ancestor
- To check whether binary trees are mirror of each other
- Convert a binary tree to it's mirror
- Move children to left/right
- To find node(s) at distance 'k' from root
- To find path from root to a given node
- To find out some of all nodes' data
- Binary tree traversals - Preorder, Inorder, Postorder
- Diameter of binary tree
- Height of binary tree
- BST Insertion, deletion etc.
- Binary search
- Binary search in circularly sorted array
- To find out the number of times sorted array is rotated
- To reverse an array
- To rotate an array by 'd'
- To find out Pair(s) with given sum 's' in sorted array
- To find out Pair(s) with given sum 's' in unsorted array
- Rearrange numbers in array such that +ve & -ve numbers are placed alternatively
- Move all -ve numbers to the left and +ve numbers to the right in array
- Segregate 0's & 1's in an array