# Google Interview Tree node with x and y value on same level

Given an arbitrary tree starting at “root” where each node contains a pair of values (x, y), write a boolean function find(Node root, int x, int y) that returns true iff * x is equal to a value “x” of any node n1 in the tree * and y is equal to a value “y”… Read more

# Find all nodes at each level in binary tree

# Find inorder successor in a binary search tree

# Algorithm to create a binary tree with minimal height

# Algorithm to find out whether there is a route between two nodes

# Utility for graph related algorithm

# Implement a function to check if a tree is balanced, valid AVL Tree.

For valid AVL tree we just need to identify the difference of Max depth and Min depth should not grater than 1. Example of valid AVL Tree is Here root node is A and from A max depth is 3 and min depth is 2 so difference is 3-2 = 1 valid. Example of invalid… Read more