Uses of binary tree
What are the uses of binary tree?
Expert
Binary Tree: A binary tree is a tree structure that each node consists of only two child nodes. The primary node is termed as root node. The parent consists of two nodes namely right and left child.
Uses of binary tree are as given below:
- For creating sorting routine.
- For persisting data items for the function of fast lookup later.
- To inserting a newest item quicker.
Describe in brief the word Merge Sort?
Explain about the priority queue?
Write down some of the limitations of arrays?
Explain about the Huffman algorithm.
What is meant by the double linked list?
Describe in brief the term binary search?
What do you mean by Huffman algorithm?
How is the front of the queue computed?
Briefly describe the term Bubble Sort and Quick sort?
What does isEmpty() member technique determines?
18,76,764
1958955 Asked
3,689
Active Tutors
1412109
Questions Answered
Start Excelling in your courses, Ask an Expert and get answers for your homework and assignments!!