Move ADT's to adt directory.

happy-san · happy-san · commit bda44780778e · 2020-11-22T12:18:48.000+05:30
diff --git a/lib/trees/adt/binary_tree_adt.dart b/lib/trees/adt/binary_tree_adt.dart
@@ -1,4 +1,4 @@
-import './tree_adt.dart';
+import 'tree_adt.dart';
 
 /// Declares members of a binary node.
 abstract class BinaryNodeADT<N extends BinaryNodeADT<N, V>,
diff --git a/lib/trees/adt/tree_adt.dart b/lib/trees/adt/tree_adt.dart
diff --git a/lib/trees/avl_tree.dart b/lib/trees/avl_tree.dart
@@ -1,5 +1,5 @@
 // @dart=2.9
-import './binary_tree_adt.dart';
+import 'adt/binary_tree_adt.dart';
 import 'binary_search_tree.dart';
 import 'binary_tree.dart';
 
diff --git a/lib/trees/binary_search_tree.dart b/lib/trees/binary_search_tree.dart
@@ -1,5 +1,5 @@
 // @dart=2.9
-import './binary_tree_adt.dart';
+import 'adt/binary_tree_adt.dart';
 import 'binary_tree.dart';
 
 /// Hierarchical data structure of individual [BinaryNode]s.
diff --git a/lib/trees/binary_tree.dart b/lib/trees/binary_tree.dart
@@ -1,5 +1,5 @@
 // @dart=2.9
-import 'binary_tree_adt.dart';
+import 'adt/binary_tree_adt.dart';
 
 /// A binary node has at most two children, which are referred to as the
 ///  [left] child and the [right] child.
diff --git a/lib/trees/red_black_tree.dart b/lib/trees/red_black_tree.dart
@@ -1,5 +1,5 @@
 // @dart=2.9
-import './binary_tree_adt.dart';
+import 'adt/binary_tree_adt.dart';
 import 'binary_search_tree.dart';
 import 'binary_tree.dart';
 

Original file line number	Diff line number	Diff line change
`@@ -1,4 +1,4 @@`
`1`		`-import './tree_adt.dart';`
	`1`	`+import 'tree_adt.dart';`
`2`	`2`
`3`	`3`	`/// Declares members of a binary node.`
`4`	`4`	`abstract class BinaryNodeADT<N extends BinaryNodeADT<N, V>,`