Ask Question
4 April, 23:26

JAVA In basic tree data structures, edges are unidirectional.

True

False

+3
Answers (1)
  1. 5 April, 02:29
    0
    True.

    Explanation:

    In the tree data structure the edges are unidirectional as their direction is from parent to child. If you are iterating on the tree you cannot move backward in the tree that is from child to parent. That's why recursion is preferred for tree because you can backtrack in recursion very easily.

    Hence the answer is true. Edges are unidirectional in the tree data structure.
Know the Answer?
Not Sure About the Answer?
Find an answer to your question ✅ “JAVA In basic tree data structures, edges are unidirectional. True False ...” in 📘 Computers and Technology if you're in doubt about the correctness of the answers or there's no answer, then try to use the smart search and find answers to the similar questions.
Search for Other Answers