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 sorted by date for query binary tree. Sort by relevance Show all posts
Showing posts sorted by date for query binary tree. Sort by relevance 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...
How to get height of BST using recursive way
The height of a Binary Search Tree is the length of the longest downward path to a leaf from root node. This is commonly needed in the manipulation of the various self-balancing trees, AVL...
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...
Cool !!! How to find the diameter of a binary tree
Given a binary tree, you need to compute the length of the diameter of the tree. The diameter of a binary tree is the length of the longest path between any two nodes in a tree....
Know How to find all leaf nodes in binary tree
Create a Binary Tree with from the given array of values and then find all the leaf nodes from left to right. Leaf nodes are nothing but bottom/last nodes with both left and right...
