- Tree Traversals
- Level Order Tree Traversal
- Maximum Depth or Height of a Tree
- Count leaf nodes in a binary tree
- Given a binary tree, print out all of its root-to-leaf paths one per line.
- Write a C program to Delete a Tree
- If you are given two traversal sequences, can you construct the binary tree?
- Print Ancestors of a given node in Binary Tree
- Print nodes at k distance from root
- Maximum width of a binary tree
BST:
- Search and Insert in BST
- Deletion from BST
- Inorder predecessor and successor for a given key in BST
- Lowest Common Ancestor in a Binary Search Tree
- Find the node with minimum value in a Binary Search Tree
- Find k-th smallest element in BST (Order Statistics in BST)
No comments:
Post a Comment