What will be the index of leaf node in a right-skewd binary tree with height =7,where every parent has at most one child?​

There are 2 leaf nodes in the given binary tree.

Explanation:

A tree stores the elements in the form of a hierarchal structure. The first node which has children is called the root of the tree. And the nodes with no children are called leaf nodes.

In the given diagram, we can see that all nodes have children except C and D so C and D are leaf nodes.

Hence,

There are 2 leaf nodes in the given binary tree.

answer; wireshark;