This slide is part of course designed for placement preparation for students of IIT Guwahati.

1. Placement Preparation
Binary Trees II

2. That’s why we call it a tree

3. Example
Find maximum sum of root to leaf path in a
binary tree.

4. Example
Find maximum leaf to leaf path in a binary
tree.

5. Example
Level order traversal.

6. Binary Search Tree
http://www.comp.nus.edu.sg/~stevenha/visu
alization/bst.html