Implement level order traverse to BST

Author: hamednikzad

src/ConsoleApp/Ds/Trees.cs

@@ -21,6 +21,7 @@ private static void BinaryTreeUsage()
  bTree.TraversePreOrder();
  bTree.TraverseInOrder();
  bTree.TraversePostOrder();
+ bTree.TraverseLevelOrder();
 
  bTree.Remove(13);
 
@@ -53,8 +54,8 @@ private static void AvlTreeUsage()
 
  public static void Use()
  {
- //BinaryTreeUsage();
- AvlTreeUsage();
+ BinaryTreeUsage();
+ //AvlTreeUsage();
  }
 
 }

src/ConsoleApp/Program.cs

@@ -18,12 +18,12 @@ public static void Main()
  // Lists.Use();
  // Stacks.Use();
  // Queues.Use();
- // Trees.Use();
+ Trees.Use();
  // Sorting
  // Sorting.Use();
 
  // Encoding
- Encoding.Use();
+ // Encoding.Use();
  }
 }
 

src/DataStructures/AbstractDataTypes/Trees/AvlTree.cs

@@ -167,30 +167,30 @@ private static Node GetBalancedTree(Node current)
  private static Node RotateRr(Node parent)
  {
  var pivot = parent.Right;
- parent.Right = pivot.Left;
+ parent.Right = pivot!.Left;
  pivot.Left = parent;
  return pivot;
  }
 
  private static Node RotateLl(Node parent)
  {
  var pivot = parent.Left;
- parent.Left = pivot.Right;
+ parent.Left = pivot!.Right;
  pivot.Right = parent;
  return pivot;
  }
 
  private static Node RotateLr(Node parent)
  {
  var pivot = parent.Left;
- parent.Left = RotateRr(pivot);
+ parent.Left = RotateRr(pivot!);
  return RotateLl(parent);
  }
 
  private static Node RotateRl(Node parent)
  {
  var pivot = parent.Right;
- parent.Right = RotateLl(pivot);
+ parent.Right = RotateLl(pivot!);
  return RotateRr(parent);
  }
 

src/DataStructures/AbstractDataTypes/Trees/BinarySearchTree.cs

@@ -106,7 +106,7 @@ public void Remove(T data)
  {
  return _root is null ? null : Max(_root);
  }
- 
+
  private static T Min(Node node)
  {
  var min = node.Data;
@@ -204,4 +204,33 @@ private static void TraversePostOrder(Node? parent)
  TraversePostOrder(parent.Right);
  Console.Write(parent.Data + " ");
  }
+
+ /// <summary>
+ /// Level Order
+ /// </summary>
+ public void TraverseLevelOrder()
+ {
+ Console.Write($"TraverseLevelOrder(LRD) with Depth {GetDepth()}: ");
+ TraverseLevelOrder(_root);
+ Console.WriteLine();
+ }
+
+ private static void TraverseLevelOrder(Node? parent)
+ {
+ if (parent is null)
+ return;
+
+ var q = new Queue<Node>();
+ q.Enqueue(parent);
+ while (q.Count > 0)
+ {
+ var r = q.Dequeue();
+ Console.Write(r.Data + " ");
+ 
+ if (r.Left is not null)
+ q.Enqueue(r.Left);
+ if (r.Right is not null)
+ q.Enqueue(r.Right);
+ }
+ }
 }