DSA Day 82/100
Topic: Tree
1) Iterative Inorder TraversalEasy2) Level Order TraversalEasy3) Height of Binary TreeEasy
Iterative Inorder Traversal
Input:
1
/ \
3 2
Output: 3 1 2
class Node {
int data;
Node left, right;
Node(int item)...
preetikaprakash.hashnode.dev2 min read