EulerFormula
diff --git a/‎src/com/zejian/structures/Tree/AVLTree/AVLNode.java‎
Lines changed: 32 additions & 0 deletions b/‎src/com/zejian/structures/Tree/AVLTree/AVLNode.java‎
Lines changed: 32 additions & 0 deletions
@@ -0,0 +1,32 @@
+package com.zejian.structures.Tree.AVLTree;
+
+/**
+ * Created by zejian on 2016/12/25.
+ * Blog : http://blog.csdn.net/javazejian [原文地址,请尊重原创]
+ * 平衡二叉搜索树(AVL树)节点
+ */
+public class AVLNode<T extends Comparable> {
+
+    public AVLNode<T> left;//左结点
+
+    public AVLNode<T> right;//右结点
+
+    public T data;
+
+    public int height;//当前结点的高度
+
+    public AVLNode(T data) {
+        this(null,null,data);
+    }
+
+    public AVLNode(AVLNode<T> left, AVLNode<T> right, T data) {
+        this(left,right,data,0);
+    }
+
+    public AVLNode(AVLNode<T> left, AVLNode<T> right, T data, int height) {
+        this.left=left;
+        this.right=right;
+        this.data=data;
+        this.height = height;
+    }
+}