## Anti Clockwise spiral traversal of a binary tree

Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2… Read More »

- Print nodes in top view of Binary Tree | Set 2
- Print the nodes of binary tree as they become the leaf node
- Print path between any two nodes in a Binary Tree
- Amazon On-Campus - 6 months Internship (SDE)
- Search a node in Binary Tree
- Count pairs in a binary tree whose sum is equal to a given value x
- Find the maximum node at a given level in a binary tree
- Sum of nodes at maximum depth of a Binary Tree | Set 2
- Check whether a given binary tree is skewed binary tree or not?
- Iterative Method To Print Left View of a Binary Tree
- Sum of all odd nodes in the path connecting two given nodes
- Shortest distance between two nodes in an infinite binary tree
- Some Basic Theorems on Trees
- Lowest Common Ancestor in Parent Array Representation
- Find maximum among all right nodes in Binary Tree
- Check if two trees have same structure
- Print Sum and Product of all Non-Leaf nodes in Binary Tree
- Introduction to Merkle Tree
- Reverse zigzag Traversal of a Binary Tree
- Clockwise Spiral Traversal of Binary Tree
- Level Order Predecessor of a node in Binary Tree
- Level Order Successor of a node in Binary Tree
- Count of pairs violating BST property
- Sort the path from root to a given node in a Binary Tree
- Check if two nodes are in same subtree of the root node
- XOR of path between any two nodes in a Binary Tree
- Iterative Boundary traversal of Complete Binary tree
- Memory representation of Binomial Heap
- Sum of all the Boundary Nodes of a Binary Tree
- Distribute candies in a Binary Tree

Given a binary tree, the task is to print the nodes of the tree in an anti-clockwise spiral manner. Examples: Input: 1 / \ 2… Read More »

Given a binary tree, the task is to print the reverse level order in spiral form. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary Tree, the task is to print the leaf nodes from left to right. The nodes must be printed in the order they… Read More »

Given a Binary Tree, the task is to print the zigzag order of the tree. Examples: Input : 7 / \ 6 5 / /… Read More »

Given a binary tree and an integer K, the task is to remove all the nodes which are multiples of K from the given binary… Read More »

Given a Binary Tree with distinct values, the task is to print the first smallest root to leaf path. We basically need to print the… Read More »

Given a Binary Tree, the task is to print the Reverse zigzag Order of the tree. Examples: Input: 1 / \ 2 3 / \… Read More »

Given a Binary tree, print all the leaf nodes of a Binary tree at a given level L. Examples: Input: 1 / \ 2 3… Read More »

Given a binary tree with N nodes, in which each node value represents number of candies present at that node, and there are N candies… Read More »

Given a Binary Tree, print it’s left view. Left view of a Binary Tree is a set of nodes visible when tree is seen from… Read More »

Given a binary tree, the task is to print the sum of all the boundary nodes of the tree. Examples: Input: 1 / \ 2… Read More »

Given a root node to a tree, find the sum of all the leaf nodes which are at maximum depth from root node. Example: 1… Read More »

Given a Binary Tree, return following value for it. For every level, compute sum of all leaves if there are leaves at this level. Otherwise… Read More »

Given a complete binary tree, traverse it such that all the boundary nodes are visited in Anti-Clockwise order starting from the root. Example: Input: 18… Read More »

Given a Binary Tree. The task is to print the circular clockwise spiral order traversal of the given binary tree. For the above binary tree,… Read More »