Binary Tree

Program to Print all the Root to Leaf Paths in the Binary Search Tree

Binary Tree / Leave a Comment / By admin

Given a Binary Search Tree (BST), print all paths starting from root to leaf. Example, Input Output 20 -> 10 -> 520 -> 10 -> 1520 -> 30 -> 2520 -> 30 -> 35 Algorithm The question is very simple. If you look carefully at the output of the above example, you will notice that …

Program to Print all the Root to Leaf Paths in the Binary Search Tree Read More »

Binary Tree Level Order Traversal

Binary Tree, Linked List / Leave a Comment / By admin

Given a Binary Tree, print level order traversal. Example, Input Binary Tree Output 10 5 20 4 8 15 25 Algorithm We will discuss two ways to print the level order traversal of the binary tree. Both use queue and are very similar. Level Order Traversal Using Queue First Approach As we know, queue follows …

Binary Tree Level Order Traversal Read More »