package com;

import com.binaryTree.TreeMaxWidth;

public class TestCode {

 public static class Node {
 public int value;
 public Node left;
 public Node right;

 public Node(int data) {
 this.value = data;
 }
 }

 // 创建随机 二叉搜索树
 // for test
 public static Node generateRandomBST(int maxLevel, int maxValue) {
 return generate(1, maxLevel, maxValue);
 }

 // for test
 // level为当前创建节点的层数
 public static Node generate(int level, int maxLevel, int maxValue) {
 if (level > maxLevel || Math.random() < 0.5) {
 return null;
 }
 Node head = new Node((int) (Math.random() * maxValue));
 head.left = generate(level + 1, maxLevel, maxValue);
 head.right = generate(level + 1, maxLevel, maxValue);
 return head;
 }
}