From cf4e3207266661770ac313e785c04b2024a6957b Mon Sep 17 00:00:00 2001 From: Amit Date: Thu, 11 Jun 2020 20:13:45 +0530 Subject: [PATCH] added details --- data_structures/binary_trees/threaded_binary_trees.c | 6 +++++- 1 file changed, 5 insertions(+), 1 deletion(-) diff --git a/data_structures/binary_trees/threaded_binary_trees.c b/data_structures/binary_trees/threaded_binary_trees.c index 1f62788d..9213ba5a 100644 --- a/data_structures/binary_trees/threaded_binary_trees.c +++ b/data_structures/binary_trees/threaded_binary_trees.c @@ -2,12 +2,16 @@ * @file * \brief This file is a simple implementation of a Threaded Binary Tree * + * Threaded Binary Tree is a binary tree variant in which all left child + * pointers that are NULL (in Linked list representation) point to its + * in-order predecessor, and all right child pointers that are NULL + * (in Linked list representation) point to its in-order successor. * It has the following functionalities: * - Insertion * - Search * - Deletion * - Listing of node keys inorder,preorder,postorder - * + * \author [Amitha Nayak](https://github.com/amitnayakblr) */