0
I can only think of one at the moment: It's a slow way of finding data. Let's say you have an employee tree, the CEO (Parent root) at the top, two children (Both managers), and each child has a further three children (Employees). If you had to find a certain employee, some trees force you to follow a certain path in order to locate them, some are more efficient that others, whilst some may take a long time.
Still curious? Ask our experts.
Chat with our AI personalities
Professor
Ezra
Devin
Add your answer:
Earn +20 pts
What is traverse technique used in chain survey?
1. pre-order b-tree traversal. 2. in-order b-tree traversal. 3. post-order b-tree traversal
Why recursive solution is better for tree traversal?
Because a tree is a recursive data-structure. It's easier to write (and easier to understand) a recursive program for handling it.
Which of the following traversal is used for printing the keys of binary search tree in ascending order?
In order traversal is used.
Is sorting a binary search tree simple?
A binary search tree is already ordered. An in order traversal will give you a sorted list of nodes.
How do you print all data in a Binary Search Tree?
By using Depth First Search or Breadth First search Tree traversal algorithm we can print data in Binary search tree.
