Which of the following is the implementation of the ternary tree?

› Category: Questions › Which of the following is the implementation of the ternary tree?
0 Vote Up Vote Down
Editor">Editor Staff asked 5 months ago

Which of the following is the implementation of the ternary tree?
 
(a) AVL Tree
 
(b) Ternary Heap
 
(c) Hash Table
 
(d) Dictionary
 
Enquiry is from Ternary Tree topic in division Trees of Data Structures & Algorithms I
 
The question was asked in my homework.

Question Tags:
1 Answers
0 Vote Up Vote Down
Editor">Editor Staff answered 5 months ago

Correct answer is (b) Ternary Heap
 
Explanation: Ternary tree is used to implement ternary search tree and ternary heap. While AVL Tree, hash Table, dictionary are different types of Data Structures.


Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17

Notice: Trying to get property 'ID' of non-object in /home/fvckxqmi/public_html/wp-content/themes/blocksy/inc/single/single-helpers.php on line 17
Articles: 40701

Related Posts