Technical Questions‎ > ‎DS‎ > ‎

Tree

1. The binary tree is given. Print row elements in zig-zag order.
               1
        2            3
    4        5    6    7
 
    Print: 1, 3, 2, 4, 5, 6, 7
 
2. What is threaded tree.
 
3. Write a preorder traversal of a binary search tree w/o recursion / stack / extra memory storage. Hint - you can augment the node data structure. However, you can't add a visited field to the node.

4. Print the path from root to a particular node given as input in a binary tree in the sequential order.

(need not be BST or balanced).

Subpages (1): Solution
Comments