What is Ternary Tree

Last Updated : 26 Sep, 2023

Data Structure and Algorithms Course
Recent articles on Tree

What is a Ternary Tree?

A Ternary Tree is a tree data structure in which each node has at most three child nodes, usually distinguished as “left”, “mid” and “right”.

For example: Consider the tree below. Since each node of this tree has only 3 children, it can be said that this tree is a Ternary Tree.

Ternary Tree

Ternary Tree

Some interesting problems on Ternary Tree:

  1. Create a Doubly Linked List from a Ternary Tree
  2. Ternary Search Tree
  3. Ternary Search Tree (Deletion)
  4. Longest word in ternary search tree
  5. How to implement text Auto-complete feature using Ternary Search Tree

Please write comments if you find anything incorrect, or if you want to share more information about the topic discussed above

Share your thoughts in the comments

Similar Reads