GeeksforGeeks

Write the pseudocode and C++/Java code to mirror a binary tree.

Written-Qn-2) Write complete working code (only the function) to traverse a binary tree in ZigZag order.

void printTree(Node *root)

Example:

      1
    /   \
  2        3
 / \       / \
4   5    6   7

O/P: 1 3 2 4 5 6 7

construct tree from the given ancestor matrix, optimize your solution.

Min and max nodes of a quad tree

AVL tree vs Red Black Tree

basic questions BST and AVL trees

given a binary tree, convert it to doubly linked list. if you are going for a company interview, then read the solution before interview.

a function to get the longest path in a given binary tree.

Given a BST and the elements of the tree are negated , rearrange the tree such that final output is also a BST

Say you have a binary tree which looks like this

         A
     /      \
    B        C
   / \      / \
  D  E   F  G
  /        /
 H       I

Assume A is level 1. So here you can see that the width at level 3 = 4, which is the max width of the tree. So given a binary tree, find the max width of the tree.This is your function:

public int findWidth(Node root)

and public Node{
String val;
Node getLeft();
Node getRight();
}

Hello,

I have a requirement to compare two trees. Anz algorithm for this???

Thanks in Advance!!

Write an algorithm to create the mirror image of a binary tree

http://geeksforgeeks.org/?p=4358
http://geeksforgeeks.org/?p=4386

construct a balanced binary search tree from a sorted array.

Given a binary tree, programmatically you need to prove it is a binary search tree.

Given a binary tree, convert it into a binary search tree. Is it possible to do this in-place without using any extra memory ?

Can anybody suggest/provide me the algorithm of inorder traversal without stack/recursion??