This is the very first blog post of the video description of the of the youtube video released on 3rd April 2017.

The topic for the video is checking if a binary tree is a subtree or not. This video is released as part of video series on trees data structure. The video starts off with describing the problem statement. The definition of a subtree can be sometimes misunderstood therefore the presenter takes the help of Wikipedia to find out the actual definition of a subtree. According to Wikipedia,

A

subtreeof a treeTis a tree consisting of a node inTand all of its descendants inT

Afterwards, The presenter right away starts with finding the possible solution for the problem. To solve the problem, The presenter coins concepts like tree traversals. Tree traversals are the algorithms which traverse the tree is some fashion to get the values of the node data. There are 3 very popular tree traversals.

- Pre-order
- Post-order
- In-order

The presenter goes on to explain these traversals.

**Pre-Order : **

- Check if the current node is empty/null.
- Display the data part of the root (or current node).
- Traverse the left subtree by recursively calling the pre-order function.
- Traverse the right subtree by recursively calling the pre-order function.

**In-Order :**

- Check if the current node is empty/null.
- Traverse the left subtree by recursively calling the in-order function.
- Display the data part of the root (or current node).
- Traverse the right subtree by recursively calling the in-order function.

**Post-Order :**

- Check if the current node is empty/null.
- Traverse the left subtree by recursively calling the post-order function.
- Traverse the right subtree by recursively calling the post-order function.
- Display the data part of the root (or current node).

After that, Presenter reveals that traversals define few interesting characteristics of a binary tree.

For example.,

- If the binary tree is BST then inorder traversal gives us
**ascending order**of the values of the nodes. - For any binary tree, pre/post and inorder
**uniquely identifies a tree.**

2nd point is interesting and can be directly applied to solve our problem i.e to find whether a tree is a subtree of another tree or not. But how? The presenter explains that if a smaller tree’s pre and inorder elements are subarray of bigger tree’s pre and inorder elements respectively then we can confirm that tree is a subtree. The presenter starts implementing the actual algorithm.

** **

// method to find if a tree is a subtree

bool BinaryTree::isSubtree(node *big, node *small) {

// data structures to collect the values of the nodes encounterd while traversing the tree

vector<int> preOrderBigCollector;

vector<int> inOrderBigCollector;

vector<int> preOrderSmallCollector;

vector<int> inOrderSmallCollector;preOrderTraversal(big, preOrderBigCollector);

preOrderTraversal(small, preOrderSmallCollector);inOrderTraversal(big, inOrderBigCollector);

inOrderTraversal(small, inOrderSmallCollector);return isSubArray(preOrderBigCollector, preOrderSmallCollector) && isSubArray(inOrderBigCollector, inOrderSmallCollector);

}

** **

This is one the efficient solution for this problem. The worst case time complexity for this problem is O(n). But in the video presenter has used a vague approach to find is subarray. Due to that the complexity worsens to O(n2). Therefore, If we use KMP pattern matching algorithm for the same then the ideal time complexity can be achieved.

**author’s note:**

*This is my first post. As you have realized I have I used 3rd person style of writing. I can sometimes criticize myself from what I have done in the video ( of course, for the positive personal growth ). Hope you liked this post! *

LIKE + SHARE + SUBSCRIBE to AM;YourMove

https://www.youtube.com/channel/UCkAou6vl72JU7DMFYs84YYg