aboutsummaryrefslogtreecommitdiff
path: root/Computer_Science/data_structures/chapter_4/print_ascii_tree.h
diff options
context:
space:
mode:
Diffstat (limited to 'Computer_Science/data_structures/chapter_4/print_ascii_tree.h')
-rw-r--r--Computer_Science/data_structures/chapter_4/print_ascii_tree.h11
1 files changed, 10 insertions, 1 deletions
diff --git a/Computer_Science/data_structures/chapter_4/print_ascii_tree.h b/Computer_Science/data_structures/chapter_4/print_ascii_tree.h
index 12eed6a..1ddfa3b 100644
--- a/Computer_Science/data_structures/chapter_4/print_ascii_tree.h
+++ b/Computer_Science/data_structures/chapter_4/print_ascii_tree.h
@@ -1,12 +1,21 @@
+/*
+** !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
+** !!!Code originally from /http://www.openasthra.com/c-tidbits/printing-binary-trees-in-ascii/
+** !!! Just saved it, cause the website is down.
+** !!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!!
+** I use it here for learning.
+*/
#ifndef _PRINT_ASCII_TREE_H
#define _PRINT_ASCII_TREE_H
struct asciinode_struct;
typedef struct asciinode_struct asciinode;
-typedef SearchTree Tree;
#define MAX_HEIGHT 1000
+
+#ifndef INFINITY
#define INFINITY (1 << 20)
+#endif
int MIN (int X, int Y);
int MAX (int X, int Y);