Question

Q9 The post order traversal of a binary tree is A BCDEFGHIJK. Which of the following is definitely a leaf node
Ops: A.
OE
B.
OD
С. ОК
D. OB
0 10 Consid
m​

Answer 1

Answer:

С. ОК is the correct answer.

please make me brainlest for my hard work and thanks for

Answer 2

Answer:

A is the leaf node

Explanation:

In Binary Tree,

Post Order Traversal is Left Child, Right Child and Root.

And Leaf node of a binary tree are the nodes who do not have any children nodes.

So, For any binary tree,

while finding its post order traversal, we first consider the leftmost child of the tree, then its right siblings  and then the parent node. This methods continues.

Hence,

For the above sequence of post order traversal ABCDEFGIJK,

the traversal starts from A So node A is the leftmost child of that Binary tree and node A do not have any children nodes further.

Therefore,

Node A is definitely one of the leaf nodes of that Binary tree.

#SPJ3