|All-time Popular Problems|
|Top View of Binary Tree|
|Largest subarray of 0's and 1's|
|Minimize string value|
|Queue using two Stacks|
|Is Binary Number Multiple of 3|
|Find the Odd Occurence|
|Intersection of two sorted Linked lists|
|Print all nodes that don’t have sibling|
|Next larger element|
Given a binary tree, count number of nodes in it. For example, count of node in below tree is 4.
The task is to complete the method which takes one argument, root of Binary Tree. The struct Node has a data part which stores the data, pointer to left child and pointer to right child.
There are multiple test cases. For each test case, this method will be called individually.
The function should return count of nodes in tree.
1 <=T<= 30
1 <=Number of nodes<= 100
1 <=Data of a node<= 1000
1 2 L 1 3 R
10 20 L 10 30 R 20 40 L 20 60 R
There are two test casess. First case represents a tree with 3 nodes and 2 edges where root is 1, left child of 1 is 2 and right child of 1 is 3. Second test case represents a tree with 4 edges and 5 nodes.