BST - Index

Common Operations on BST

• Understanding functions of BST – insert, size and traversal
• Deleting a node from BST
• Implementing a BST in C

Traversals are covered seperately below.

Traversal in BST:

Inorder, pre order and post order traversal(recursive approach)
Inorder, pre order and post order traversal(iterative approach)
Level order traversal
Threaded binary tree
DFS and BFS on tree
Given the expression tree, calculate the expression
Construct a tree, given its inorder and pre-order

Successors and ancestors

Inorder Successor in BST
Find the closest ancestors of 2 nodes in a tree

Some easy questions on BST

• Given a binary tree,create the copy of the tree.
• Given a binary tree, count the number of nodes in the tree.
• Given a binary tree, find the maximum depth the number of nodes along the longest path from the root node down to the farthest leaf node.
• Write a code to find the minimum and maximum value in binary search tree
• Print the BST in increasing order…to put this in different way, it simply means to print in inorder traversal
• Print the post order traversal (recursive)
• Print the paths in binary search tree from root to leaves.
• Get the mirror of Binary tree
• BST : Binary search tree with double tree
• BT: How to check whether 2 trees are same or not?
• BST: How to check whether 2 trees are BST or NOT
• BST:Return Nth Node in in-order traversal