Techiio-author
Started by Peter DanielsSep 22, 2021

Open
How to prove these type of questions for Data Structures?

0 VIEWES 0 LIKES 0 DISLIKES SHARE
0 LIKES 0 DISLIKES 0 VIEWES SHARE

Let m, n be two distinct nodes in a tree T. Show that exactly one of the following four cases holds.
(a) m is to the left of n.
(b) m is a proper ancestor of n.
(c) m is to the right of n.
(d) m is a proper descendent of n.

I am not able to start it. It seems intuitive as per the structure of tree. There are many questions like this in my assignment. Any hints for these type of questions would be helpful.

0 Replies

You must be Logged in to reply
Techiio-logo

Techiio is on the journey to build an ocean of technical knowledge, scouring the emerging stars in process and proffering them to the corporate world.

Follow us on:

Subscribe to get latest updates

You can unsubscribe anytime from getting updates from us
Developed and maintained by Wikiance
Developed and maintained by Wikiance