-
Notifications
You must be signed in to change notification settings - Fork 4
Tree
Suyash Soni edited this page Mar 10, 2018
·
19 revisions
- Serialization & Deserialization - Binary Tree
- Serialization & Deserialization - Binary Search Tree
- Check if tree is BST
- Path(s) from root to leaves
- Pair(s) with sum equals to given sum
- Convert a unbalanced BST to balanced BST
- Construct a BST from given sorted array
- Children sum property - For each node, node.data = node.left.data + node.right.data (for leaves data=0)
- 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
- Tree views - Top, Left, Bottom, Right
- 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 sum of all nodes' data
- Binary tree traversals - Preorder, Inorder, Postorder, Level order
- Vertical sum of binary tree
- Diameter of binary tree
- Maximum width of binary tree
- Height of binary tree
- Print diagonals of binary tree
- Diagonal sum of a binary tree
- BST - CRUD, min-max, height etc.
- Segment Tree