Simple, how to get only left child in BST
As same as traversals like inorder, preorder, postorder and level order we need to traverse to BST and need to print only the left child of each nodes in Binary Search Tree. From below...
Showing posts with label Binary Search Tree. Show all posts
Showing posts with label Binary Search Tree. Show all posts
How to do Level order traversal in Binary Search Tree
We have see lot of tutorials based on Binary tree and also other traversals like Inorder, Preorder and Postorder etc., Now in this tutorial lets see how to do Level order traversal of Binary...
Counting nodes in a tree? Yes how to get Binary Tree size
Counting nodes in a tree? Yes how to get Binary Tree size nothing but counting all the nodes in a Binary Tree. For example the size of the below binary tree is 11 Lets...
How to do Iterative Postorder Traversal in BST
Earlier we have seen lot of tutorials related to Binary Search Tree like How to find the diameter of a binary tree Converting a Binary Tree into its Mirror Tree Inorder Predecessor and Successor...
Inorder Predecessor and Successor of Binary Search Tree
In a given Binary Search Tree need to find the predecessor and Successor of a given node. What is Predecessor and Successor ? In a given Binary Search Tree highest element on the left...
