package src.common.node;

import com.chao.week03.C_BinarySearchTreeValisate;

import src.utils.DeprecatedPrintTreeUtils;

/**

@Author wangwenchao

@Date 2020/11/22 19:29

@Description

@Version 1.0

二叉树

*/

public class TreeNode {

public int val;

public TreeNode left;

public TreeNode right;

public TreeNode(int x) { val = x; }

// //中序遍历

@Override

public String toString() {

StringBuffer sb = new StringBuffer();

sb.append("[");

toString(sb,this);

sb.append("]");

if (sb.toString().startsWith("[,")) {

sb.replace(0,2,"[");

}

return sb.toString();

}

private void toString(StringBuffer sb, TreeNode node) {

if (node == null) {

return;

}

toString(sb,node.left);

sb.append(",");

sb.append(node.val);

toString(sb,node.right);

}

public int getVal() {

return val;

}

public void setVal(int val) {

this.val = val;

}

public TreeNode getLeft() {

return left;

}

public void setLeft (TreeNode left) {

this.left = left;

}

public TreeNode getRight() {

return right;

}

public void setRight (TreeNode right) {

this.right = right;

}

public int getPathLevel() {

return DeprecatedPrintTreeUtils.getTreeDepth(this);

}

public static void main(String[] args) {

TreeNode root = new TreeNode(2);

TreeNode left = new TreeNode(1);

TreeNode right = new TreeNode(7);

root.left =left;

root.right =right;

System.out.println(new C_BinarySearchTreeValisate().isValidBST(root));

// 5

// / \

// 1 4

// / \

// 3 6

// src.common.node.TreeNode root = new src.common.node.TreeNode(5);

// src.common.node.TreeNode left = new src.common.node.TreeNode(1);

// src.common.node.TreeNode right = new src.common.node.TreeNode(4);

// src.common.node.TreeNode right_left = new src.common.node.TreeNode(3);

// src.common.node.TreeNode right_right = new src.common.node.TreeNode(6);

// root.left =left;

// root.right =right;

// root.right.left =right_left;

// root.right.right =right_right;

System.out.println(root.toString());

System.out.println(root);

}

}