Level Order Traversal in Zig Zag pattern OR Print in Spiral Pattern
Objective: Given a binary Tree, Do Level Order Traversal in Zig Zag pattern OR Print in Spiral Input: A Binary Tree Output: Order Traversal in Zig Zag pattern OR Print in Spiral.
Tagged: Expert
Inorder Successor in Binary Search Tree without Using Parent link
Objective: Given a Binary Search tree, find the inorder successor of a node. What is Inorder Successor: Inorder successor of a node is the next node in the inorder traversal of the tree. For...
Inorder Successor in Binary Search Tree Using Parent link
Algorithms – Inorder Successor in Binary Search Tree Using Parent link Objective: Given a Binary Search tree in which every node has a link to its parent, find the inorder successor of a node....
In a Binary Tree, Create Linked Lists of all the nodes at each depth.
Objective: Given a Binary tree create Linked Lists of all the nodes at each depth , say if the tree has height k then create k linked lists. NOTE : This problem is very...
Rearrange Positive and Negative Numbers of Array On Each Side in O(nlogn)
Objective: Rearrange Positive and Negative Numbers of an Array so that one side you have positive numbers and other side with negative Integers without changing their respective order. Example : Input : 1 -2...