Question

Question

- modify the code below so that for a node, the value of every node of its right subtree is less the node, and the value of each node of its left subtree is greater than the node.
- create such a binary tree in the Main method, and call the following method:

•  InOrder(Node theRoot),

•  PreOrder(Node theRoot),

•  PostOrder(Node theRoot),

•  FindMin(),

•  FindMax(),

•  Find(int key)

  using System;
  using System.Collections.Generic; using System.Linq;
  using System.Text;
  using System.Threading.Tasks;

  namespace ConsoleApplication38 {

  public class Node {

  public int Data;
  public Node Left;
  public Node Right;
  public void DisplayNode() {

  Console.Write(Data + " "); }

  }

  public class BinarySearchTree {

  public Node root;
  public BinarySearchTree() {

  root = null; }

  public void Insert(int i) {

  Node newNode = new Node(); newNode.Data = i;

  if (root == null) {

root = newNode;

} else {

Node current = root; Node parent;
while (true)
{

parent = current;
if (i < current.Data) {

current = current.Left; if (current == null)
{

parent.Left = newNode;

break; }

} else {

break; }

}
}//end of while(true)

}//end of else
}//end of public void Insert(int i)

public void InOrder(Node theRoot) {

if (!(theRoot == null)) {

InOrder(theRoot.Left); theRoot.DisplayNode(); InOrder(theRoot.Right);

} }

public void PreOrder(Node theRoot) {

if (!(theRoot == null)) {

theRoot.DisplayNode(); PreOrder(theRoot.Left); PreOrder(theRoot.Right);

} }

public void PostOrder(Node theRoot) {

if (!(theRoot == null)) {

PostOrder(theRoot.Left); PostOrder(theRoot.Right); theRoot.DisplayNode();

} }

current = current.Right; if (current == null)
{

parent.Right = newNode;

public int FindMin() {

Node current = root;
while (!(current.Left == null))

current = current.Left; return current.Data;

}

public int FindMax() {

Node current = root;
while (!(current.Right == null))

current = current.Right; return current.Data;

}

public Node Find(int key) {

Node current = root;
while (current.Data != key) {

if (key < current.Data) current = current.Left;

else
current = current.Right; if (current == null)

return null; }

return current; }

static void Main() {

// }

}//end of public class BinarySearchTree }

Answer 1