Sign Up to our social questions and Answers Engine to ask questions, answer people’s questions, and connect with other people.
Login to our social questions & Answers Engine to ask questions answer people’s questions & connect with other people.
Lost your password? Please enter your email address. You will receive a link and will create a new password via email.
Please briefly explain why you feel this question should be reported.
Please briefly explain why you feel this answer should be reported.
Please briefly explain why you feel this user should be reported.
Since trees are special kind of graphs or we can categorize trees in DAG(Directed Acyclic Graphs) but how can we differentiate between Threaded Binary Trees and Graphs? Can we categorize threaded binary tree in DAG?
A threaded binary tree is not a DAG, since it has cycles, but it is easy to treat it as one in any algorithm by not following threads (think treating them as NULL pointers).
It is also easy to convert any Threaded Binary Tree into a Binary Tree by removing all the threads.