Given a binary tree with the following constraints: a) A node has either both a left and right child OR no children b) The right child of a node is either a leaf or NULL
write code to invert this tree. HINT: Draw this out
Reproduce tree, given the preorder & inorder traversals
[2007-09-05 21:10:15]   
Given a preorder and inorder traversal of a binary tree, can you reproduce the tree? if yes, then write a function using C/C++ that builds the tree and returns the root node of the tree.
Given a tree such that each node has a child and sibling, find a node in the tree. Prioritize the search by level (ie., check all siblings before children). Hint: use a queue